The generating graph of some monolithic groups. (Q662032): Difference between revisions

Let \(G\) be a finite group. The generating graph for \(G\), denoted \(\Gamma(G)\), is the graph defined on the nonidentity elements of \(G\) and there is an edge between \(g_1\) and \(g_2\) if \(G\) is generated by \(g_1\) and \(g_2\). In [\textit{T. Breuer} et al., Bull. Lond. Math. Soc. 42, No. 4, 621-633 (2010; Zbl 1223.20058)] many results concerning Hamiltonian cycles in the generating graph of a finite group are obtained. In this paper under review, the authors investigate the Hamiltonicity of \(\Gamma(G)\) in the case when \(G\) is a wreath product \(S\wr C_m\) of a nonabelian simple group \(S\) and a cyclic group of order \(m\), \(C_m\). Precisely, let \(\Lambda_m\) denote the \((m+1)\)-closure of \(\Gamma(C_m)\), define a positive integer \(m\) to be Hamiltonian if every nontrivial element of \(C_m\), whose order is of the form \(m/l\) (with \(l\) odd), is adjacent in \(\Lambda_m\) to every other nontrivial element of \(G\). The main result of this paper is that if \(m\) is Hamiltonian, then there exists a positive integer \(\alpha\), which depends on \(m\), such that if \(S\) is a nonabelian simple group with \(|S|\geq\alpha\) then the generating graph \(\Gamma(S\wr C_m)\) has a Hamiltonian cycle. The authors do not know an example of a non-Hamiltonian positive integer, so they conjecture that every positive integer \(m\) is Hamiltonian.