Power graphs of (non)orientable genus two
Group Theory
2015-12-17 v4 Combinatorics
Abstract
The power graph of a finite group 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.
Cite
@article{arxiv.1509.02104,
title = {Power graphs of (non)orientable genus two},
author = {Xuanlong Ma and Gary L. Walls and Kaishun Wang},
journal= {arXiv preprint arXiv:1509.02104},
year = {2015}
}
Comments
17 pages, 7 figures