Abstract
In this paper, the problem of construction of exponentially many minimum genus embeddings of complete graphs in surfaces are studied. There are three approaches to solve this problem. The first approach is to construct exponentially many graphs by the theory of graceful labeling of paths; the second approach is to find a current assignment of the current graph by the theory of current graph; the third approach is to find exponentially many embedding (or rotation) schemes of complete graph by finding exponentially many distinct maximum genus embeddings of the current graph. According to this three approaches, we can construct exponentially many minimum genus embeddings of complete graph K 12s+8 in orientable surfaces, which show that there are at least \(\frac{10}{3} \times (\frac{200}{9})^s\) distinct minimum genus embeddings for K 12s+8 in orientable surfaces. We have also proved that K 12s+8 has at least \(\frac{10}{3} \times (\frac{200}{9})^s\) distinct minimum genus embeddings in non-orientable surfaces.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aldred, R. E. L., Širáň, J., Širáň, M.: A note on the number of graceful labellings of paths. Discrete Mathematics, 261, 27–30 (2003)
Bonnington, C. P., Grannell, M. J., Griggs, T. S., et al.: Face 2-colourable triangular embeddings of complete graphs. Journal of Combinatorial Theory, Series B, 74, 8–19 (1998)
Bonnington, C. P., Grannell, M. J., Griggs, T. S., et al.: Exponential families of non-isomorphic triangulations of complete graphs. Journal of Combinatorial Theory, Series B, 78, 169–184 (2000)
Goddyn, L., Richter, R. B., Širáň, J.: Triangular embeddings of complete graphs from graceful labellings of paths. Journal of Combinatorial Theory, Series B, 97, 964–970 (2007)
Korzhik, V. P., Voss, H.-J.: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. Journal of Combinatorial Theory, Series B, 91, 253–287 (2004)
Korzhik, V. P., Voss, H.-J.: On the number nonisomorphic orientable regular embeddings of complete graphs. Journal of Combinatorial Theory, Series B, 81, 58–76 (2001)
Korzhik, V. P., Voss, H.-J.: Exponential families of nonisomorphic nontriangular orientable genus embeddings of complete graphs. Journal of Combinatorial Theory, Series B, 86, 186–211 (2002)
Lawrencenko, S.: The irreducible triangulations of the torus. Ukrain. Geom., 30, 52–62 (1987)
Lawrencenkno, S., Negami, S., White, A. T.: Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discrete Mathematics, 135, 367–369 (1994)
Liu, Y. P.: The maximum orientable genus of some kinds of graph. Acta Mathematica Sinica, 24, 817–132 (1981)
Liu, Y. P.: The maximum orientable genus of a graph. Scientia Sinica, Special Issue on Math, 192–201 (1979)
Liu, Y. P.: Embeddability in Graphs, Kluwer, Dordrecht/Boston/London, 1995
Ren, H., Bai, Y.: Exponentially many maximum genus embeddings and genus embedings for complete graphs. Sci. China Ser. A, 51(11), 2013–2019 (2008)
Ringel, G.: Map Color Theorem, Springer-Verlag, Berlin, 1974
Skoviera, M.: The maximum genus of graphs of diameter two. Discrete Mathematics, 87, 175–180 (1991)
Xuong, N. H.: How to determine the maximum genus of a graph. Journal of Combinatorial Theory, Series B, 23, 217–225 (1979)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NSFC (Grant Nos. 10771225, 11171114) and the Scientific Research Projects of State Ethnic Affairs Commission (Grant No. 14ZYZ016)
Rights and permissions
About this article
Cite this article
Li, Z.X., Ren, H. Minimum genus embeddings of the complete graph. Acta. Math. Sin.-English Ser. 32, 1246–1254 (2016). https://doi.org/10.1007/s10114-016-5425-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-016-5425-3