On the deep commuting graph of a finite group
Sumana Hatui, Sanjay Mukherjee, Kamal Lochan Patra

TL;DR
This paper studies the deep commuting graph of finite groups, revealing conditions for completeness, classifying groups with perfect graphs, and exploring various properties and special cases.
Contribution
It provides new characterizations of the deep commuting graph, including conditions for completeness, perfection, and equivalence with other graphs for specific classes of groups.
Findings
Deep commuting graph is complete iff the group is cyclic.
Classified finite simple, symmetric, and alternating groups with perfect deep commuting graphs.
Analyzed properties like Eulerianess, universality, and connectedness of the graphs.
Abstract
Let be a finite group and let be a Schur cover of . The deep commuting graph of is a simple graph with vertex set , where two distinct vertices are adjacent if their pre-images commute in . The deep commuting graph of a finite group was first introduced in [P. J. Cameron and B. Kuzma, Between the enhanced power graph and the commuting graph, {\it J. Graph Theory} {\bf 102} (2023), no. 2, 295--303], where the authors have shown that is fixed irrespective of the choice of the Schur cover . In this paper, we first prove that is complete if and only if is cyclic. Also, we classify finite simple groups, symmetric groups and alternating groups, for which is perfect. In addition, explore several other properties of like Eulerianess, universality and connectedness of reduced…
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 applications · Interconnection Networks and Systems
