The complement of proper power graphs of finite groups
T. Anitha, R. Rajkumar, Andrei Gagarin

TL;DR
This paper studies the complement of proper power graphs of finite groups, classifying their structure under various graph-theoretic properties and determining key parameters like diameter and girth.
Contribution
It provides a comprehensive classification of finite groups based on the properties of their complement proper power graphs, including structural and topological characteristics.
Findings
Classified groups with complete, bipartite, path, cycle, star, claw-free, triangle-free, disconnected, planar, outer-planar, toroidal, or projective complement graphs.
Determined the diameter and girth of the complement graphs for finite groups.
Identified structural conditions for the complement graphs to have specific properties.
Abstract
For a finite group , the proper power graph of is the graph whose vertices are non-trivial elements of and two vertices and are adjacent if and only if and or for some positive integer . In this paper, we consider the complement of , denoted by . 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.
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 · graph theory and CDMA systems · Advanced Graph Theory Research
