Characterization of SL(2,q) by its non-commuting graph
Alireza Abdollahi

TL;DR
This paper proves that the non-commuting graph uniquely characterizes the group SL(2,q), meaning any group with an isomorphic non-commuting graph to SL(2,q) must be isomorphic to it.
Contribution
It establishes that the non-commuting graph completely determines the structure of SL(2,q) among finite groups.
Findings
Non-commuting graph of SL(2,q) is unique to the group.
Any group with an isomorphic non-commuting graph to SL(2,q) is isomorphic to SL(2,q).
The result characterizes SL(2,q) by its non-commuting graph.
Abstract
Let be a non-abelian group and be its center. The non-commuting graph of is the graph whose vertex set is and two vertices are joined by an edge if they do not commute. Let be the special linear group of degree 2 over the finite field of order . In this paper we prove that if is a group such that for some prime power , then .
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 · Coding theory and cryptography · graph theory and CDMA systems
