The non‐F graph of a finite group
From MaRDI portal
Publication:6073368
Abstract: Given a formation , we consider the graph whose vertices are the elements of and where two vertices are adjacent if and only if . We are interested in the two following questions. Is the set of the isolated vertices of this graph a subgroup of ? Is the subgraph obtained by deleting the isolated vertices a connected graph?
Recommendations
Cites work
- scientific article; zbMATH DE number 3520437 (Why is no real title available?)
- Finite groups with planar generating graph
- Finite soluble groups
- Groups Whose Elements Have Bounded Orders
- Groups which are minimal with respect to normality being intransitive
- Minimal non-\(\mathcal F\)-groups.
- Non-commuting graph of a group.
- Non-nilpotent graph of a group.
- On the finite groups of supersoluble type.
- On the intersection of all maximal \(\mathcal F\)-subgroups of a finite group.
- The generating graph of finite soluble groups.
- Thompson-like characterizations of the solvable radical.
Cited in
(6)- scientific article; zbMATH DE number 6703496 (Why is no real title available?)
- Finite groups with star-free noncyclic graphs
- On the connectivity of the non-generating graph
- Semiregularity and connectivity of the non-𝔉 graph of a finite group
- Disconnectedness of the subgraph \(F^3\) for the group \({\varGamma}^3\)
- NON-NORMAL GRAPHS OF FINITE GROUPS
This page was built for publication: The non‐F graph of a finite group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073368)