pith. sign in

arxiv: 1601.01894 · v1 · pith:7T35DCQNnew · submitted 2016-01-08 · 🧮 math.GR

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

classification 🧮 math.GR
keywords graphprimefinitegroupgroupssametextrmcalled
0
0 comments X
read the original 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 $\textrm{PGL}(2,9)$. In particular, we present some solvable groups with the same prime graph as $\textrm{PGL}(2,9)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.