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

2016/01/08 by Ali Mahmoudifar, Mahmoudifar, Ali
Mathematics · #20D05 #20D08 #20D60 #F.2.2 #FOS: Mathematics #Group Theory (math.GR) #I.2.7 #acm:20D05 #acm:20D08 #acm:20D60 #math.GR #msc:20D05 #msc:20D08 #msc:20D60

paper · pdf · doi:10.48550/arxiv.1601.01894

5 pages

arxiv created 2016/01/08 · arxiv updated 2016/01/11

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 \textrmPGL(2,9). In particular, we present some solvable groups with the same prime graph as \textrmPGL(2,9).

Related

• On some Frobenius groups with the same prime graph as the almost simple group PGL(2,49)
• \M, \B and \Co₁ are recognisable by their prime\n graphs
• Criteria for Classifying Prime Graphs of PSL(2, q)-Solvable Groups
• Classifying prime graphs of finite groups -- a methodical approach
• A classification of prime graphs of pseudo-solvable groups