English

The non-commuting, non-generating graph of a non-simple group

Group Theory 2023-11-13 v2

Abstract

Let GG be a (finite or infinite) group such that G/Z(G)G/Z(G) is not simple. The non-commuting, non-generating graph Ξ(G)\Xi(G) of GG has vertex set GZ(G)G \setminus Z(G), with vertices xx and yy adjacent whenever [x,y]1[x,y] \ne 1 and x,yG\langle x, y \rangle \ne G. We investigate the relationship between the structure of GG and the connectedness and diameter of Ξ(G)\Xi(G). In particular, we prove that the graph either: (i) is connected with diameter at most 44; (ii) consists of isolated vertices and a connected component of diameter at most 44; or (iii) is the union of two connected components of diameter 22. 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 G/Z(G)G/Z(G) is finite and simple.

Keywords

Cite

@article{arxiv.2211.08869,
  title  = {The non-commuting, non-generating graph of a non-simple group},
  author = {Saul D. Freedman},
  journal= {arXiv preprint arXiv:2211.08869},
  year   = {2023}
}

Comments

25 pages. Minor corrections to the proofs of Lemmas 4.9, 5.6 and 5.7