Superpower graphs of finite groups

From MaRDI portal





For a finite group \(G\), the superpower graph \(S(G)\) of \(G\) is an undirected simple graph with vertex set \(G\) and two vertices are adjacent in \(S(G)\) if and only if the order of one divides the order of the other in \(G\). This paper provides tight bounds for the vertex connectivity and discusses Hamiltonian-like properties of the superpower graph of finite non-abelian groups having an element of exponent order. The authors also give some general results about superpower graphs and their relation to other graphs.











This page was built for publication: Superpower graphs of finite groups

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