On the proper enhanced power graphs of finite nilpotent groups

From MaRDI portal
Publication:2093232





Let \(G\) be a group. The enhanced power graph of \(G\) is a graph with vertex set \(G\), in which two distinct vertices \(x\) and \(y\) are joined by an edge if and only if there exists an element \(z\) in \(G\) such that \(\langle x\rangle\subseteq \langle z\rangle\) and \(\langle y\rangle \subseteq \langle z\rangle\). The proper enhanced power graph of \(G\) is the graph obtained by deleting all the dominating vertices of the enhanced power graph of \(G\). In this paper, all nilpotent groups \(G\) for which the proper enhanced power graph is connected have been classified and their diameter has been calculated. Also, the domination number of the proper enhanced power graphs of finite nilpotent groups is calculated explicitly. Finally, the multiplicity of the Laplacian spectral radius of the enhanced power graphs of nilpotent groups has been determined.



Cites work









This page was built for publication: On 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 Q2093232)