arXiv Analytics

Sign in

arXiv:2008.09291 [math.GR]AbstractReferencesReviewsResources

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

Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal

Published 2020-08-21Version 1

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.

Related articles: Most relevant | Search more
arXiv:2211.08869 [math.GR] (Published 2022-11-16)
The non-commuting, non-generating graph of a non-simple group
arXiv:math/0510151 [math.GR] (Published 2005-10-07, updated 2006-09-19)
Retracts of vertex sets of trees and the almost stability theorem
arXiv:1511.07418 [math.GR] (Published 2015-11-23)
A family of class-2 nilpotent groups, their automorphisms and pro-isomorphic zeta functions