On the connectivity of the generating and rank graphs of finite groups

DOI10.1016/J.JALGEBRA.2024.10.030MaRDI QIDQ6667404FDOQ6667404

Authors: Andrea Lucchini, Daniele Nemmi 

Publication date: 20 January 2025

Published in: Journal of Algebra (Search for Journal in Brave)

Recommendations

• The generating graph of finite soluble groups.
• On the connectivity of the non-generating graph
• The independence graph of a finite group
• The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.
• Graphs encoding the generating properties of a finite group

zbMATH Keywords

finite groupsalmost simple groupsgenerating graphrank graph

Mathematics Subject Classification ID

Special aspects of infinite or finite groups (20Fxx) Abstract finite groups (20Dxx) Probabilistic methods in group theory (20Pxx)

Cites Work

• Title not available (Why is that?)
• Crowns and factorization of the probabilistic zeta function of a finite group.
• Classes of Finite Groups
• Probabilistic generation of finite simple groups
• Probabilistic generation of finite simple groups. II.
• Generators for finite groups with a unique minimal normal subgroup
• Probabilistic generation of finite groups with a unique minimal normal subgroup.
• Title not available (Why is that?)
• Pre-Frattini groups.
• The probability of generating a finite simple group
• The probability of generating a finite classical group
• The generating graph of finite soluble groups.
• The probability of generating the symmetric group
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• Generators for Simple Groups
• Zu einem von B. H. und H. Neumann gestellten Problem
• Some results and questions related to the generating graph a finite group.
• On complemented nonabelian chief factors of a finite group
• On the probability of generating finite groups with a unique minimal normal subgroup.
• Simple Groups, Generation and Probabilistic Methods
• The spread of a finite group
• The Spread of Almost Simple Classical Groups
• The diameter of the generating graph of a finite soluble group
• Probabilistic generation of finite almost simple groups

Cited In (1)

• On the strong connectivity of the \(2\)-Engel graphs of almost simple groups

This page was built for publication: On the connectivity of the generating and rank graphs of finite groups

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