The power graph of a group is a graph with vertex set , in which two vertices are adjacent if one is some power of the other. In the commuting graph, with as the vertex set, two vertices are joined by an edge if they commute in . The enhanced power graph of a group is a graph with vertex set and an edge joining two vertices and if is cyclic. In this paper, we answer a question posed by P. J. Cameron, namely, if there exist groups and such that the power graph of is isomorphic to the commuting graph of . We show that the answer is yes if is the generalised quaternion group and is the dihedral group. We also show that the enhanced power graph of the dicyclic group is isomorphic to the commuting graph of the dihedral group.

生成讲解博客的中文版本

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