Certain properties of the enhanced power graph associated with a finite group

DOI10.1007/S10474-023-01304-YMaRDI QIDQ6404645arXivFDO

Authors Jitender Kumar, Xuanlong Ma, Parveen, S. P. Singh

Publication date 11 July 2022

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite nilpotent groups, (p)-groups (20D15)

Abstract: The enhanced power graph of a finite group $G$, denoted by $mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x,y$ are adjacent if $x,yinlanglezangle$ for some $zinG$. In this article, we determine all finite groups such that the minimum degree and the vertex connectivity of $mathcal{P}_E(G)$ are equal. Also, we classify all groups whose (proper) enhanced power graphs are strongly regular. Further, the vertex connectivity of the enhanced power graphs associated to some nilpotent groups is obtained. Finally, we obtain a lower bound and an upper bound for the Wiener index of $mathcal{P}_E(G)$, where $G$ is a nilpotent group. The finite nilpotent groups attaining these bounds are also characterized.

This page was built for publication: Certain properties of the enhanced power graph associated with a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404645)