Proof of a conjecture of Abdollahi-Akbari-Maimani concerning the non-commutative graph of finite groups
Luis A. Dupont, Daniel G. Mendoza, Armando S\'anchez-Nungaray

TL;DR
This paper proves a conjecture stating that non-commuting graphs uniquely determine the order of non-abelian finite groups, confirming that isomorphic graphs imply groups have the same size.
Contribution
The paper provides a proof that the non-commuting graph of a non-abelian finite group uniquely determines its order, resolving a previously open conjecture.
Findings
Non-commuting graphs distinguish non-abelian finite groups by order.
Isomorphic non-commuting graphs imply groups have equal size.
The conjecture by Abdollahi-Akbari-Maimani is confirmed.
Abstract
The non--commuting graph of a non--abelian group is defined as follows. The vertex set of is where denotes the center of and two vertices and are adjacent if and only if . For non--abelian finite groups and it is conjectured that if , then . We prove the conjecture.
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 · Graph theory and applications
