Nilpotent groups whose Difference graphs have positive genus (2301.12849v1)
Abstract: The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group $G$ is a simple undirected graph whose vertex set is the group $G$ and two vertices $a$ and $b$ are adjacent if there exists $c \in G$ such that both $a$ and $b$ are powers of $c$. In this paper, we study the difference graph $\mathcal{D}(G)$ of a finite group $G$ which is the difference of the enhanced power graph and the power graph of $G$ with all isolated vertices removed. We characterize all the finite nilpotent groups $G$ such that the genus (or cross-cap) of the difference graph $\mathcal{D}(G)$ is at most $2$.
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.