Classification of nonorientable regular embeddings of complete bipartite graphs

https://doi.org/10.1016/j.jctb.2011.03.003Get rights and content
Under an Elsevier user license
open archive

Abstract

A 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags – mutually incident vertex–edge–face triples. In this paper, we classify the regular embeddings of complete bipartite graphs Kn,n into nonorientable surfaces. Such a regular embedding of Kn,n exists only when n is of the form n=2p1a1p2a2pkak where the pi are primes congruent to ±1 mod 8. In this case, up to isomorphism the number of those regular embeddings of Kn,n is 2k.

Keywords

Graph
Surface
Regular embedding
Regular map

Cited by (0)

The first and the second authors are supported by the Korea Research Foundation Grant funded Korean Government KRF-2007-313-C00011 and KRF-2008-331-C00049, respectively.