A Classification of Orientable Regular Embeddings of Complete Multipartite Graphs

Abstract

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

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…