The non-commuting, non-generating graph of a nilpotent group (Q2223469)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7303539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The non-commuting, non-generating graph of a nilpotent group |
scientific article; zbMATH DE number 7303539 |
Statements
The non-commuting, non-generating graph of a nilpotent group (English)
0 references
29 January 2021
0 references
Summary: For a nilpotent group \(G\), let \(\Xi(G)\) be the difference between the complement of the generating graph of \(G\) and the commuting graph of \(G\), with vertices corresponding to central elements of \(G\) removed. That is, \( \Xi(G)\) has vertex set \(G \setminus Z(G)\), with two vertices adjacent if and only if they do not commute and do not generate \(G\). Additionally, let \(\Xi^+(G)\) be the subgraph of \(\Xi(G)\) induced by its non-isolated vertices. We show that if \(\Xi(G)\) has an edge, then \(\Xi^+(G)\) is connected with diameter \(2\) or \(3\), with \(\Xi(G) = \Xi^+(G)\) in the diameter \(3\) case. In the infinite case, our results apply more generally, to any group with every maximal subgroup normal. When \(G\) is finite, we explore the relationship between the structures of \(G\) and \(\Xi(G)\) in more detail.
0 references
commuting graph
0 references
generating graph
0 references
0.865655243396759
0 references
0.8353477120399475
0 references
0.8345118165016174
0 references
0.834182858467102
0 references
0.8287469744682312
0 references