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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081486720 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2008.09291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the power graph and the enhanced power graph of a group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commuting graph of a group. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The groups of order at most 2000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic generation of finite simple groups. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite groups, 2-generation and the uniform domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The non-isolated vertices in the generating graph of a direct powers of simple groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no upper bound for the diameter of the commuting graph of a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Burnside problem for periodic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of the generating graph of a finite soluble group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of the commuting graph of a finite group with trivial centre. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nielsen equivalence in Gupta-Sidki groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Andrews-Curtis and Nielsen equivalence relations on some infinite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMAL SUBGROUPS OF SOME NON LOCALLY FINITE p-GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Das ``schiefe Produkt'' in der Gruppentheorie mit Anwendung auf die endlichen nichtkommutativen Gruppen mit lauter kommutativen echten Untergruppen und die Ordnungszahlen, zu denen nur kommutative Gruppen gehören / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a 2-generated infinite 3-group: The presentation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal subgroups of direct products / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:56, 24 July 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
    0 references