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

preprint2020arXivOpen access

Abstract

For a nilpotent group GG, let Ξ(G)Ξ(G) be the difference between the complement of the generating graph of GG and the commuting graph of GG, with vertices corresponding to central elements of GG removed. That is, Ξ(G)Ξ(G) has vertex set G∖Z(G)G \setminus Z(G), with two vertices adjacent if and only if they do not commute and do not generate GG. Additionally, let Ξ+(G)Ξ^+(G) be the subgraph of Ξ(G)Ξ(G) induced by its non-isolated vertices. We show that if Ξ(G)Ξ(G) has an edge, then Ξ+(G)Ξ^+(G) is connected with diameter 22 or 33, with Ξ(G)=Ξ+(G)Ξ(G) = Ξ^+(G) in the diameter 33 case. In the infinite case, our results apply more generally, to any group with every maximal subgroup normal. When GG is finite, we explore the relationship between the structures of GG and Ξ(G)Ξ(G) in more detail.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.