On the unrecognizability by prime graph for the almost simple group PGL(2,9)

DOI10.7151/DMGAA.1256zbMATH Open1463.20043arXiv1601.01894OpenAlexW2569447900MaRDI QIDQ5136396FDOQ5136396

Ali Mahmoudifar

Publication date: 26 November 2020

Published in: Discussiones Mathematicae - General Algebra and Applications (Search for Journal in Brave)

Abstract: The prime graph of a finite group $G$ is denoted by $ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $ga(H)=ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with the same prime graph as $extrmPGL(2,9)$. In particular, we present some solvable groups with the same prime graph as $extrmPGL(2,9)$.

Full work available at URL: https://arxiv.org/abs/1601.01894

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)\).

zbMATH Keywords

prime graphrecognitionprojective general linear group

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cited In (1)

• Semisymmetric graphs admitting primitive groups of degree \(9p\)

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)