加载中…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of this graph and when this graph is a complete graph. Finally, we classify when this graph is the empty graph.

生成讲解博客的中文版本

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