On The Unrecognizability by Prime Graph for the Most Simple Group ${\rm {\bf PGL(2,9)}}$
Ali Mahmoudifar

TL;DR
This paper classifies all finite groups sharing the prime graph with PGL(2,9), revealing that some solvable groups are indistinguishable from PGL(2,9) based solely on their prime graph.
Contribution
It provides a complete classification of groups with the same prime graph as PGL(2,9), including solvable groups, highlighting unrecognizability by prime graph.
Findings
Identified all groups with the same prime graph as PGL(2,9)
Discovered solvable groups sharing the prime graph with PGL(2,9)
Showed PGL(2,9) is unrecognizable by prime graph
Abstract
The prime graph of a finite group is denoted by . Also is called recognizable by prime graph if and only if each finite group with , is isomorphic to . In this paper, we classify all finite groups with the same prime graph as . In particular, we present some solvable groups with the same prime graph as .
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
