The non-commuting, non-generating graph of a finite simple group

Abstract

Let G be a group such that G/Z(G) is finite and simple. The non-commuting, non-generating graph (G) of G has vertex set G Z(G), with edges corresponding to pairs of elements that do not commute and do not generate G. Complementing our previous investigation of this graph for non-simple groups, we show that (G) is connected with diameter at most 5, with smaller upper bounds for certain families of groups. Using these bounds, we then prove that when G is simple, the diameter of the complement of the generating graph of G has a tight upper bound of 4, with the exception of at most one group with a graph of diameter 5.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…