The generating graph of some monolithic groups.

DOI10.1016/J.JCTA.2011.11.007MaRDI QIDQ662032zbMATH OpenOpenAlexFDO

Authors Eleonora Crestani, Andrea Lucchini

Publication date 11 February 2012

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2011.11.007

zbMATH Keywords

finite simple groupsgenerating graphs of finite groupsHamiltonian cyclesmonolithic groupswreath products

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Finite simple groups and their classification (20D05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Extensions, wreath products, and other compositions of groups (20E22) Generators, relations, and presentations of groups (20F05)

Review text

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.

Recommendations

• Hamiltonian cycles in the generating graphs of finite groups.
• On Hamiltonian cycles in Cayley graphs of wreath products
• scientific article; zbMATH DE number 510757
• On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
• Factorizations of product graphs into cycles of uniform length
• Cayley graphs of order \(27p\) are Hamiltonian
• On Hamiltonicity of Cayley graphs of order pqr\,s
• Cayley graphs and G-graphs: some applications
• scientific article; zbMATH DE number 4148113
• Cayley graphs of order \(6pq\) and \(7pq\) are Hamiltonian

Cites work

• A method in graph theory
• Hamiltonian cycles in the generating graphs of finite groups.
• scientific article; zbMATH DE number 5150116 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• On the probability of generating finite groups with a unique minimal normal subgroup.
• Pancyclic graphs. I
• Probabilistic generation of finite simple groups
• Probabilistic generation of finite simple groups. II.

Cited in

(6)

• Hamiltonian cycles in the generating graphs of finite groups.
• The generating graph of finite soluble groups.
• Co-maximal graphs of two generator groups
• Generating graphs of some solvable groups
• On the generating graph in a finite group
• On the generating graphs of symmetric groups

This page was built for publication: The generating graph of some monolithic groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662032)