English

Distance matrix of enhanced power graphs of finite groups

Combinatorics 2023-06-22 v2

Abstract

The enhanced power graph of a group GG is the graph GE(G)\mathcal{G}_E(G) with vertex set GG and edge set {(u,v):u,vw, \mboxforsome wG} \{(u,v): u, v \in \langle w \rangle,~\mbox{for some}~ w \in G\}. In this paper, we compute the spectrum of the distance matrix of the enhanced power graph of non-abelian groups of order pqpq, dihedral groups, dicyclic groups, elementary abelian groups El(pn)\mathrm{El}(p^n) and the non-cyclic abelian groups El(pn)×El(qm)\mathrm{El}(p^n)\times\mathrm{El}(q^m) and El(pn)×Zm\mathrm{El}(p^n)\times \mathbb{Z}_m, where pp and qq are distinct primes. For the non-cyclic abelian group El(pn)×El(qm)\mathrm{El}(p^n)\times \mathrm{El}(q^m), 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.

Keywords

Cite

@article{arxiv.2304.04288,
  title  = {Distance matrix of enhanced power graphs of finite groups},
  author = {Anita Arora and Hiranya Kishore Dey and Shivani Goel},
  journal= {arXiv preprint arXiv:2304.04288},
  year   = {2023}
}