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

生成讲解博客的中文版本

生成AI智能校验的中文版本