The generating graph of some monolithic groups.

DOI10.1016/j.jcta.2011.11.007zbMath1332.20033OpenAlexW2067167721MaRDI QIDQ662032

Andrea Lucchini, Eleonora Crestani

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

wreath productsfinite simple groupsHamiltonian cyclesmonolithic groupsgenerating graphs of finite groups

Mathematics Subject Classification ID

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

Related Items (2)

The generating graph of finite soluble groups. ⋮ Co-maximal graphs of two generator groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the probability of generating finite groups with a unique minimal normal subgroup.
• Probabilistic generation of finite simple groups. II.
• A method in graph theory
• Probabilistic generation of finite simple groups
• Pancyclic graphs. I
• Hamiltonian cycles in the generating graphs of finite groups

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