加载中…
Let be a finite group and construct a graph by taking as the vertex set of and by drawing an edge between two vertices and if is cyclic. Let be the set consisting of the universal vertices of along the identity element. For a solvable group , we present a necessary and sufficient conditon for to be nontrivial. We also develop a connection between and when is divisible by two distinct primes and the diameter of is .

生成讲解博客的中文版本

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