Semiregularity and connectivity of the non-𝔉 graph of a finite group

DOI10.1142/s0219498823501906zbMath1520.20054arXiv2109.04252OpenAlexW4280551791MaRDI QIDQ6168136

Andrea Lucchini, Daniele Nemmi

Publication date: 8 August 2023

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

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

zbMATH Keywords

soluble groupsfinite groupsgraphsconnectivity

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Unnamed Item
• Unnamed Item
• The generating graph of finite soluble groups.
• Finite soluble groups
• The presentation rank of a direct product of finite groups
• Computing a set of generators of minimal cardinality in a solvable group
• \(d\)-wise generation of prosolvable groups.
• Groups satisfying a strong complement property
• Thompson-like characterizations of the solvable radical.
• Zu einem von B. H. und H. Neumann gestellten Problem
• On Groups all of Whose Elements Have Prime Power Order
• The non‐F graph of a finite group

This page was built for publication: Semiregularity and connectivity of the non-𝔉 graph of a finite group