Distance matrix of enhanced power graphs of finite groups
Anita Arora, Hiranya Kishore Dey, Shivani Goel

TL;DR
This paper computes the spectra of the distance matrix of enhanced power graphs for various finite groups, including non-abelian, dihedral, dicyclic, and certain abelian groups, revealing their spectral properties.
Contribution
It provides explicit spectral computations for the distance matrix of enhanced power graphs of several classes of finite groups, extending understanding of their algebraic graph properties.
Findings
Spectra of the distance matrix for non-abelian groups of order pq
Spectra for dihedral and dicyclic groups
Spectral results for elementary abelian and non-cyclic abelian groups
Abstract
The enhanced power graph of a group is the graph with vertex set and edge set . In this paper, we compute the spectrum of the distance matrix of the enhanced power graph of non-abelian groups of order , dihedral groups, dicyclic groups, elementary abelian groups and the non-cyclic abelian groups and , where and are distinct primes. For the non-cyclic abelian group , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · graph theory and CDMA systems
