The non-commuting, non-generating graph of a non-simple group
arXiv:2211.08869 · doi:10.5802/alco.305
Abstract
Let be a (finite or infinite) group such that is not simple. The non-commuting, non-generating graph of has vertex set , with vertices and adjacent whenever and . We investigate the relationship between the structure of and the connectedness and diameter of . In particular, we prove that the graph either: (i) is connected with diameter at most ; (ii) consists of isolated vertices and a connected component of diameter at most ; or (iii) is the union of two connected components of diameter . We also describe in detail the finite groups with graphs of type (iii). In the companion paper arXiv:2212.01616, we consider the case where is finite and simple.
arXiv comment25 pages. Minor corrections to the proofs of Lemmas 4.9, 5.6 and 5.7