Classification of nonorientable regular embeddings of complete bipartite graphs
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 regular embedding of Kn,n exists only when n = 2p1a1p2a2... pkak (a prime decomposition of n) and all pi 1 ( 8). In this case, the number of those regular embeddings of Kn,n up to isomorphism is 2k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.