The diameter of the generating graph of a finite soluble group (Q2411394)

Let \(G\) be a \(2\)-generated finite group. The generating graph for \(G\), written \(\Gamma (G)\), is the graph where the vertices are the nonidentity elements of \(G\) and there is an edge between \(x\) and \(y\) if \(G\) is generated by \(x\) and \(y\). Let \(\Delta (G)\) be the subgraph of \(\Gamma (G)\) that is induced by all the vertices that are not isolated. In the paper under review, the author first shows that if \(G\) is a \(2\)-generated soluble group, then \(\Delta (G)\) is connected and \(\mathrm{ diam}(\Delta (G))\leq 3\). Note that the connectivity of \(\Delta (G)\) for a \(2\)-generated soluble group has already been proved in [Isr. J. Math. 198, 63--74 (2013; Zbl 1300.20021)]. Next, he claims that the bound \(\mathrm{ diam} (\Delta (G))\leq 3\) is sharp for soluble groups. For this purpose, he constructs a \(2\)-generated group \(G\) of order \(2^{10}\cdot 3^2\) with \(\mathrm{ diam}(\Delta (G))=3\). Finally, he proves that \(\mathrm{ diam}(\Delta (G))\leq 2\) in the following cases: (a) \(G'\) has odd order, (b) \(G'\) is nilpotent, and (c) \(G\) is soluble and for every nontrivial irreducible \(G\)-module \(V\) which is \(G\)-isomorphic to a complemented chief factor of \(G\), \(|\mathrm{ End}_G(V)|>2\).