Difference graphs of finite abelian groups with two Sylow subgroups (2404.18167v1)
Abstract: The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ 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 $\mathbf G$, denoted by $\mathcal D(\mathbf G)$, is the difference of the enhanced power graph and the power graph of group $\mathbf G$ 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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.