On the connectivity of the non-generating graph (Q2140593): Difference between revisions

Let \(G\) be a finite group generated by two elements. The non-generating graph of \(G\) has vertices elements of \(G\) and two distinct vertices are joined by an edge if they don't generate \(G\). In the paper under review the authors prove that if the commutator subgroup of \(G\) is not nilpotent, then the non-generating graph of \(G\) is connected with diameter at most \(5\).