The generating graph of finite soluble groups. (Q375497): Difference between revisions

In recent years several authors have investigated the generating graph of a finite group. Given a finite group \(G\), the generating graph, denoted by \(\Gamma(G)\), is the graph whose vertices are the non-identity elements of \(G\) and two distinct vertices are connected by an edge if and only if they generate \(G\). Clearly, if \(G\) is not \(2\)-generated, then all the vertices in this graph are isolated, that is, there are no edges. So, it is natural to consider the case when \(G\) is \(2\)-generated. For such a group, let \(\Delta(G)\) be the subgraph of \(\Gamma(G)\) obtained by removing the isolated vertices. The main result of the paper under review states that if \(G\) is soluble, and \(2\)-generated, then \(\Delta(G)\) is connected. The key tool for the proof is the notion of crown, introduced by \textit{W. Gaschütz} [Arch. Math. 13, 418-426 (1962; Zbl 0109.01403)]. The authors point out that they obtained an analogous result [in J. Algebr. Comb. 37, No. 2, 249-263 (2013; Zbl 1276.20026)] for the case when \(G\) is a direct product of finite non-Abelian simple groups. Also, they observe that no example is known of a group \(G\) for which \(\Delta(G)\) is not connected.