The non-two-primes graph of a finite group

Abstract

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $⟨x,y⟩$ is divisible by at least 3 distinct primes. We prove that the subgraph of this graph induced by the non-isolated vertices is connected and has diameter at most 5.