On the unrecognizability by prime graph for the almost simple group PGL(2,9)
From MaRDI portal
Publication:5136396
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 .
Recommendations
- Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
- On some Frobenius groups with the same prime graph as the almost simple group \(\mathrm{PGL}(2,49)\)
- On the prime graph of a finite group.
- Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
- Quasirecognition by prime graph of the simple groups \(G_2(q)\) and \(^2B_2(q)\).
Cited in
(8)- Semisymmetric graphs admitting primitive groups of degree \(9p\)
- Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
- Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
- Some characterizations of \(L_9(2)\) related to its prime graph.
- On the recognizability of some projective general linear groups by the prime graph
- NCF-distinguishablity by prime graph of \(\text{PGL}(2,p)\) where \(p\) is a prime
- On some Frobenius groups with the same prime graph as the almost simple group \(\mathrm{PGL}(2,49)\)
- On the prime graph of a finite group.
This page was built for publication: On the unrecognizability by prime graph for the almost simple group \(\mathrm{PGL}(2,9)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136396)