The non-commuting, non-generating graph of a nilpotent group
Group Theory
2021-02-01 v1
Abstract
For a nilpotent group , let be the difference between the complement of the generating graph of and the commuting graph of , with vertices corresponding to central elements of removed. That is, has vertex set , with two vertices adjacent if and only if they do not commute and do not generate . Additionally, let be the subgraph of induced by its non-isolated vertices. We show that if has an edge, then is connected with diameter or , with in the diameter case. In the infinite case, our results apply more generally, to any group with every maximal subgroup normal. When is finite, we explore the relationship between the structures of and in more detail.
Cite
@article{arxiv.2008.09291,
title = {The non-commuting, non-generating graph of a nilpotent group},
author = {Peter J. Cameron and Saul D. Freedman and Colva M. Roney-Dougal},
journal= {arXiv preprint arXiv:2008.09291},
year = {2021}
}
Comments
13 pages