The non-commuting, non-generating graph of a nilpotent group (Q2223469): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081486720 / rank
 
Normal rank

Revision as of 03:26, 20 March 2024

scientific article
Language Label Description Also known as
English
The non-commuting, non-generating graph of a nilpotent group
scientific article

    Statements

    The non-commuting, non-generating graph of a nilpotent group (English)
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    commuting graph
    0 references
    generating graph
    0 references
    0 references