Distance matrix of enhanced power graphs of finite groups
Abstract
The enhanced power graph of a group G is the graph GE(G) with vertex set G and edge set \(u,v): u, v ∈ w ,~for some~ w ∈ G\. In this paper, we compute the spectrum of the distance matrix of the enhanced power graph of non-abelian groups of order pq, dihedral groups, dicyclic groups, elementary abelian groups El(pn) and the non-cyclic abelian groups El(pn)×El(qm) and El(pn)× Zm, where p and q are distinct primes. For the non-cyclic abelian group El(pn)× El(qm), we also compute the spectrum of the adjacency matrix of its enhanced power graph and the spectrum of the adjacency and the distance matrix of its power graph.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.