English

A Classification of Orientable Regular Embeddings of Complete Multipartite Graphs

Combinatorics 2012-06-12 v2

Abstract

Let Km[n]K_{m[n]} be the complete multipartite graph with mm parts, while each part contains nn vertices. The orientably-regular embeddings of complete graphs Km[1]K_{m[1]} have been determined by Biggs (1971) \cite{Big1}, James and Jones (1985) \cite{JJ}. During the past twenty years, several papers such as Du et al.(2007, 2010) \cite{DJKNS1,DJKNS2}, Jones et al. (2007, 2008) \cite{JNS1,JNS2}, Kwak and Kwon (2005, 2008) \cite{KK1,KK2} and Nedela et al. (1997, 2002)\cite{NS,NSZ} contributed to the orientably-regular embeddings of complete bipartite graphs K2[n]K_{2[n]} and the final classification was given by Jones \cite{Jon1} in 2010. Based on our former paper \cite{ZD}, this paper gives a complete classification of orientably-regular embeddings of graphs Km[n]K_{m[n]} for the general cases m3m\ge 3 and n2n\ge 2.

Keywords

Cite

@article{arxiv.1202.1974,
  title  = {A Classification of Orientable Regular Embeddings of Complete Multipartite Graphs},
  author = {Shaofei Du and Junyang Zhang},
  journal= {arXiv preprint arXiv:1202.1974},
  year   = {2012}
}

Comments

20 pages

R2 v1 2026-06-21T20:17:05.686Z