加载中…
The prime graph of a finite group is denoted by whose vertex set is and two distinct primes and are adjacent in , whenever contains an element with order . We say that is unrecognizable by prime graph if there is a finite group with , in while . In this paper, we consider finite groups with the same prime graph as the almost simple group . Moreover, we construct some Frobenius groups whose their prime graph coincide with , in particular, we get that is unrecognizable by prime graph.

生成讲解博客的中文版本

生成AI智能校验的中文版本