Complete regular dessins of odd prime power order

被引:9
作者
Hu, Kan [1 ,2 ]
Nedela, Roman [3 ,4 ]
Wang, Na-Er [1 ,2 ]
机构
[1] Zhejiang Ocean Univ, Sch Math Phys & Informat Sci, Zhoushan 316022, Zhejiang, Peoples R China
[2] Key Lab Oceanog Big Data Min & Applicat Zhejiang, Zhoushan 316022, Zhejiang, Peoples R China
[3] Univ West Bohemia, Dept Math, NTIS FAV, Plzen, Czech Republic
[4] Slovak Acad Sci, Math Inst, Banska Bystrica, Slovakia
基金
中国国家自然科学基金;
关键词
Graph embedding; Dessin d'enfant; Metacyclic group; COMPLETE BIPARTITE GRAPHS; EMBEDDINGS; CLASSIFICATION; HYPERMAPS;
D O I
10.1016/j.disc.2018.09.028
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:314 / 325
页数:12
相关论文
共 23 条
  • [21] Regular embeddings of complete bipartite graphs
    Nedela, R
    Skoviera, M
    Zlatos, A
    [J]. DISCRETE MATHEMATICS, 2002, 258 (1-3) : 379 - 381
  • [22] Xu M. Y., 2010, FINITE P GROUPS
  • [23] Zassenhaus H., 1949, THEORY GROUPS