Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777438 | European Journal of Combinatorics | 2017 | 18 Pages |
Abstract
A hypermap is a cellular embedding of a connected bipartite graph G into a compact and connected surface S without border. The vertices of G lie in distinct partitions, colored black and white, and are called respectively the hypervertices and hyperedges of the hypermap, while the connected regions of GâS are the hyperfaces. A hypermap H is called orientable if the underlying surface S is orientable. An orientable hypermap is called regular if its orientation preserving automorphism group G acts regularly on the flags (hypervertex, hyperedge and hyperface incident triples), and further, it is called (face-)primer if G induces a faithful action on their hyperfaces. In Breda d'Azevedo and Fernandes (2011), a classification of the primer hypermap with a prime number of hyperfaces is given. In this paper, a classification will be given, for all primer hypermaps with a product of two primes hyperfaces, see Theorem 5.1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Shaofei Du, Xinyuan Hu,