On the connectivity of the non-generating graph

DOI10.1007/s00013-022-01741-1OpenAlexW3197792694MaRDI QIDQ2140593

Daniele Nemmi, Andrea Lucchini

Publication date: 23 May 2022

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.12569

zbMATH Keywords

diameterconnectivitynon-generating graph

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Related Items (1)

On groups with chordal power graph, including a classification in the case of finite simple groups

Cites Work

• Unnamed Item
• The generating graph of finite soluble groups.
• Probabilistic generation of finite simple groups. II.
• Finite soluble groups
• Exponents of almost simple groups and an application to the restricted Burnside problem
• Generators for finite groups with a unique minimal normal subgroup
• Probabilistic generation of finite simple groups
• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• The intersection graph of a finite simple group has diameter at most 5
• The diameter of the generating graph of a finite soluble group
• The spread of a finite group
• Intersection graphs of subgroups of finite groups
• On the clique number of the generating graph of a finite group
• Zu einem von B. H. und H. Neumann gestellten Problem
• Graphs defined on groups
• The non‐F graph of a finite group

This page was built for publication: On the connectivity of the non-generating graph