The non-commuting, non-generating graph of a nilpotent group

Peter J. Cameron, Saul Daniel Freedman*, Colva Mary Roney-Dougal

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Downloads (Pure)

Abstract

For a nilpotent group G, let nc(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, nc(G) has vertex set G \ Z(G), with two vertices adjacent if and only if they do not commute and do not generate G. Additionally, let nd(G) be the subgraph of nc(G) induced by its non-isolated vertices. We show that if nc(G) has an edge, then nd(G) is connected with diameter 2 or 3, with nc(G) = nd(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 nc(G) in more detail.
Original languageEnglish
Article numberP1.16
Number of pages15
JournalElectronic Journal of Combinatorics
Volume28
Issue number1
DOIs
Publication statusPublished - 29 Jan 2021

Fingerprint

Dive into the research topics of 'The non-commuting, non-generating graph of a nilpotent group'. Together they form a unique fingerprint.

Cite this