The complement of proper power graphs of finite groups

From MaRDI portal



Abstract: For a finite group G, the proper power graph mathscrP∗(G) of G is the graph whose vertices are non-trivial elements of G and two vertices u and v are adjacent if and only if ueqv and um=v or vm=u for some positive integer m. In this paper, we consider the complement of mathscrP∗(G), denoted by overlinemathscrP∗(G). We classify all finite groups whose complement of proper power graphs is complete, bipartite, a path, a cycle, a star, claw-free, triangle-free, disconnected, planar, outer-planar, toroidal, or projective. Among the other results, we also determine the diameter and girth of the complement of proper power graphs of finite groups.



Cites work









This page was built for publication: The complement of proper power graphs of finite groups

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