加载中…
The power graph of a finite group is a simple undirected graph with vertex set and two vertices are adjacent if one is a power of the other. The enhanced power graph of a finite group is a simple undirected graph whose vertex set is the group and two vertices and are adjacent if there exists such that both and are powers of . In this paper, we study the difference graph of a finite group which is the difference of the enhanced power graph and the power graph of with all isolated vertices removed. We characterize all the finite nilpotent groups such that the genus (or cross-cap) of the difference graph is at most .

生成讲解博客的中文版本

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