Paper Info
Title
Complete regular dessins of odd prime power order.
Abstract
A dessin is a 2-cell embedding of a connected 2-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper we employ group-theoretic method to determine and enumerate the isomorphism classes of regular dessins with complete bipartite underlying graphs of odd prime power order.
Year
DOI
Venue
2019
10.1016/j.disc.2018.09.028
Discrete Mathematics
Keywords
Field
DocType
Graph embedding,Dessin d’enfant,Metacyclic group
Graph,Discrete mathematics,Combinatorics,Embedding,Automorphism,Bipartite graph,Isomorphism,Prime power,Mathematics
Journal
Volume
Issue
ISSN
342
2
0012-365X
Citations 
PageRank 
References 
0
0.34
8
Authors
3
Name
Order
Citations
PageRank
Kan Hu17912.70
Roman Nedela239247.78
Na-Er Wang332.16