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









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)