On connectivity, domination number and spectral radius of the proper enhanced power graphs of finite nilpotent groups

DOI10.1515/JGTH-2022-0057arXiv2108.05175MaRDI QIDQ6375008FDOQ6375008

Authors: Sudip Bera, Hiranya Kishore Dey 

Publication date: 11 August 2021

Abstract: For a group $G,$ the enhanced power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x,y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ The proper enhanced power graph is the induced subgraph of the enhanced power graph on the set $GsetminusS,$ where $S$ is the set of dominating vertices of the enhanced power graph. In this paper, we first characterize the dominating vertices of enhanced power graph of any finite nilpotent group. Thereafter, we classify all nilpotent groups $G$ such that the proper enhanced power graphs are connected and find out their diameter. We also explicitly find out the domination number of proper enhanced power graphs of finite nilpotent groups. Finally, we determine the multiplicity of the Laplacian spectral radius of the enhanced power graphs of nilpotent groups.

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)

This page was built for publication: On connectivity, domination number and spectral radius of the proper enhanced power graphs of finite nilpotent groups

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