Semiregularity and connectivity of the non-đ graph of a finite group
From MaRDI portal
Publication:6168136
DOI10.1142/S0219498823501906zbMATH Open1520.20054arXiv2109.04252OpenAlexW4280551791MaRDI QIDQ6168136FDOQ6168136
Authors: Andrea Lucchini, Daniele Nemmi
Publication date: 8 August 2023
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Abstract: Given a class of finite groups, we consider the graph whose vertices are the elements of and where two vertices are adjacent if and only if . Moreover we denote by the set of the isolated vertices of We address the following question: to what extent the fact that is a subgroup of for any implies that the graph obtained from by deleting the isolated vertices is a connected graph?
Full work available at URL: https://arxiv.org/abs/2109.04252
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Cites Work
- Finite soluble groups
- Finite group theory.
- Title not available (Why is that?)
- The generating graph of finite soluble groups.
- Computing a set of generators of minimal cardinality in a solvable group
- Zu einem von B. H. und H. Neumann gestellten Problem
- The presentation rank of a direct product of finite groups
- Thompson-like characterizations of the solvable radical.
- On Groups all of Whose Elements Have Prime Power Order
- \(d\)-wise generation of prosolvable groups.
- Groups satisfying a strong complement property
- The nonâF graph of a finite group
Cited In (3)
This page was built for publication: Semiregularity and connectivity of the non-đ graph of a finite group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168136)