Power graphs of (non)orientable genus two

2015/09/07 by Xuanlong Ma, Ma, Xuanlong, Gary L. Walls +3
Computer Science · Mathematics · #05C10 #05C25 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1509.02104

openalex publication_date 2015/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The power graph Γ_G of a finite group G is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have (non)orientable genus two.

Citations

• Commutative rings with toroidal zero-divisor graphs

Related

• Some results in a new power graphs in finite groups
• Embeddings of (proper) power graphs of finite groups
• On power graphs of finite groups with forbidden induced subgraphs
• Power Graphs of Finite Group
• k-Power Graphs of Finite Groups