On the structure of the power graph and the enhanced power graph of a group

From MaRDI portal
(Redirected from Publication:2401396)




Abstract: Let G be a group. The emph{power graph} of G is a graph with the vertex set G, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence number. For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique/chromatic number. Furthermore, it is proved that for every group G, the clique number of the power graph of G is at most countably infinite. We also measure how close the power graph is to the emph{commuting graph} by introducing a new graph which lies in between. We call this new graph as the emph{enhanced power graph}. For an arbitrary pair of these three graphs we characterize finite groups for which this pair of graphs are equal.




Cited in
(70)






This page was built for publication: On the structure of the power graph and the enhanced power graph of a group

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