A classification of orientably-regular embeddings of complete multipartite graphs

From MaRDI portal




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) 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] 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] for the general cases mge3 and nge2.









This page was built for publication: A classification of orientably-regular embeddings of complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441650)