English

Nilpotent groups whose Difference graphs have positive genus

Group Theory 2023-01-31 v1 Combinatorics

Abstract

The power graph of a finite group GG is a simple undirected graph with vertex set GG and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group GG is a simple undirected graph whose vertex set is the group GG and two vertices aa and bb are adjacent if there exists cGc \in G such that both aa and bb are powers of cc. In this paper, we study the difference graph D(G)\mathcal{D}(G) of a finite group GG which is the difference of the enhanced power graph and the power graph of GG with all isolated vertices removed. We characterize all the finite nilpotent groups GG such that the genus (or cross-cap) of the difference graph D(G)\mathcal{D}(G) is at most 22.

Keywords

Cite

@article{arxiv.2301.12849,
  title  = {Nilpotent groups whose Difference graphs have positive genus},
  author = {Jitender Kumar Parveen},
  journal= {arXiv preprint arXiv:2301.12849},
  year   = {2023}
}

Comments

13 Figures. arXiv admin note: text overlap with arXiv:2212.07705