Search arXiv⌕ Search

arXiv · 2603.19669

Structural and Spectral Properties of Prime Order Element Graph of Finite Abelian Groups

Abstract

Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $Γ(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough structural and spectral analysis of the POE graphs associated with the finite Abelian groups of different types. The order of a finite Abelian group may be a prime or a product of primes, which influences the structure of POE graphs. The POE graph is connected when the order of the Abelian group is a square-free integer. The POE graphs of the other Abelian groups have multiple connected components. Some of these components are isomorphic to the POE graph of a lower-order group. We study various graph-theoretic properties of the components, including regularity and bipartiteness. Arranging the elements of the group in a number of particular orders, we observe the block structure in the adjacency matrix of POE graphs. It assists us in investigating the spectral properties of POE graphs. We explicitly derive the characteristic polynomials governing both integral and irrational eigenvalues, and compute the eigenvalues with multiplicity in terms of the structure of the graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tapa Manna, Supriyo Dutta, Baby Bhattacharya. 2026-03-20. Structural and Spectral Properties of Prime Order Element Graph of Finite Abelian Groups. https://arxiv.org/abs/2603.19669

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗