The complement of enhanced power graph of a finite group

arXiv2207.04641MaRDI QIDQ6404560FDOQ6404560

Authors: Nazma Parveen, Jitender Kumar 

Publication date: 11 July 2022

Abstract: The enhanced power graph $mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x,y$ are adjacent if $x,yinlanglezangle$ for some $zinG$. In this article, we give an affirmative answer of the question posed by Cameron [6] which states that: Is it true that the complement of the enhanced power graph $$ of a non-cyclic group $G$ has only one connected component apart from isolated vertices? We classify all finite groups $G$ such that the graph $$ is bipartite. We show that the graph $$ is weakly perfect. Further, we study the subgraph $$ of $$ induced by all the non-isolated vertices of $$. We classify all finite groups $G$ such that the graph is $$ is unicyclic and pentacyclic. We prove the non-existence of finite groups $G$ such that the graph $$ is bicyclic, tricyclic or tetracyclic. Finally, we characterize all finite groups $G$ such that the graph $$ is outerplanar, planar, projective-planar and toroidal, respectively.

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

This page was built for publication: The complement of enhanced power graph of a finite group

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