The complement of enhanced power graph of a finite group
Parveen, Jitender Kumar

TL;DR
This paper investigates the properties of the complement of the enhanced power graph of finite groups, classifying groups based on graph properties like bipartiteness, cyclicity, and planarity, and answering a question posed by Cameron.
Contribution
It provides a complete classification of finite groups according to the structure and properties of the complement of their enhanced power graphs, including connectivity, bipartiteness, and planarity.
Findings
The complement of the enhanced power graph of a non-cyclic group has only isolated vertices and one connected component.
Classified all groups where the complement graph is bipartite, unicyclic, or pentacyclic.
Proved the non-existence of groups with bicyclic, tricyclic, or tetracyclic complement graphs.
Abstract
The enhanced power graph of a finite group is the simple undirected graph whose vertex set is and two distinct vertices are adjacent if for some . 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 has only one connected component apart from isolated vertices? We classify all finite groups 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 such that the graph is is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Synthesis of Organic Compounds · Synthesis and properties of polymers
