Finite almost simple groups with prime graphs all of whose connected components are cliques (Q2396384)

The authors study the prime graph of a finite group \(G\) under the additional condition that all connected components of the prime graph \(\Gamma (G)\) are cliques. They observe that if \(G\) is finite simple and nonabelian then, in most cases, there exist two nonadjacent vertices in \(\Gamma (G)\), which are both odd primes not dividing \(|\mathrm{Out}(G)|\). This is then used to prove Theorem 1, which considers \(G\) to be a finite almost simple but not simple group. It is shown that all connected components of the graph \(\Gamma (G)\) are cliques if and only if the graph \(\Gamma (G)\) is disconnected and \(G\) is a group from a long list containing 11 possible families of groups.