Advanced Search

Let $G$ be a finite group. The prime graph of $G$ is a simple graph $\Gamma \left(G\right)$ whose vertex set is $\pi \left(G\right)$ and two distinct vertices $p$ and $q$ are joined by an edge if and only if $G$ has an element of order $pq$. A group $G$ is called $k$-recognizable by prime graph if there exist exactly $k$ nonisomorphic groups $H$ satisfying the condition $\Gamma \left(G\right)=\Gamma \left(H\right)$. A 1-recognizable group is usually called a recognizable group. In this problem, it was proved that $\mathrm{PGL}(2,p^{\alpha })$ is recognizable, if $p$ is an odd prime and $\alpha >1$ is odd. But for even $\alpha$, only the recognizability...