Distance matrix of enhanced power graphs of finite groups (2304.04288v2)
Abstract: The enhanced power graph of a group $G$ is the graph $\mathcal{G}_E(G)$ with vertex set $G$ and edge set $ {(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 $pq$, dihedral groups, dicyclic groups, elementary abelian groups $\mathrm{El}(pn)$ and the non-cyclic abelian groups $\mathrm{El}(pn)\times\mathrm{El}(qm)$ and $\mathrm{El}(pn)\times \mathbb{Z}_m$, where $p$ and $q$ are distinct primes. For the non-cyclic abelian group $\mathrm{El}(pn)\times \mathrm{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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.