Semiregularity and connectivity of the non-đ graph of a finite group
From MaRDI portal
Publication:6168136
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?
Recommendations
Cites work
- scientific article; zbMATH DE number 1154720 (Why is no real title available?)
- Computing a set of generators of minimal cardinality in a solvable group
- Finite group theory.
- Finite soluble groups
- Groups satisfying a strong complement property
- On Groups all of Whose Elements Have Prime Power Order
- The generating graph of finite soluble groups.
- The nonâF graph of a finite group
- The presentation rank of a direct product of finite groups
- Thompson-like characterizations of the solvable radical.
- Zu einem von B. H. und H. Neumann gestellten Problem
- d-wise generation of prosolvable groups.
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)