Papers
Topics
Authors
Recent
2000 character limit reached

Nilpotent groups whose Difference graphs have positive genus (2301.12849v1)

Published 30 Jan 2023 in math.GR and math.CO

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$.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.