加载中…
The power graph and the enhanced power graph of a group are simple graphs with vertex set ; two elements of are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced power graph if they generate a cyclic subgroup. The difference graph of a group , denoted by , is the difference of the enhanced power graph and the power graph of group with all the isolated vertices removed. In this paper, we prove that, if a pair of finite abelian groups of order divisible by at most two primes have isomorphic difference graphs, then they are isomorphic.

生成讲解博客的中文版本

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