Abstract
There are many results on the maximum genus, among which most are written for the existence of values of such embeddings, and few attention has been paid to the estimation of such embeddings and their applications. In this paper we study the number of maximum genus embeddings for a graph and find an exponential lower bound for such numbers. Our results show that in general case, a simple connected graph has exponentially many distinct maximum genus embeddings. In particular, a connected cubic graph G of order n always has at least \( (\sqrt 2 )^{m + n + \tfrac{\alpha } {2}} \) distinct maximum genus embeddings, where α and m denote, respectively, the number of inner vertices and odd components of an optimal tree T. What surprise us most is that such two extremal embeddings (i.e., the maximum genus embeddings and the genus embeddings) are sometimes closely related with each other. In fact, as applications, we show that for a sufficient large natural number n, there are at least \( C2^{\tfrac{n} {4}} \) many genus embeddings for complete graph K n with n ≡ 4, 7, 10 (mod12), where C is a constance depending on the value of n of residue 12. These results improve the bounds obtained by Korzhik and Voss and the methods used here are much simpler and straight.
Similar content being viewed by others
References
Bondy J A, Murty U S R. Graph Theory with Application. London: Macmillan, 1979
Nebesky L. A new characterization of the maximum genus of a graph. Czechoslovak Math J, 31(106): 604–613 (1981)
Huang Y Q. On the maximum genus of graphs. Dissertation for Doctoral Degree. Beijing: Northern Jiaotong University, 1996
Xuong N H. How to determine the maximum genus of a graph. J Combin Theorey Ser B, 23: 217–225 (1979)
Korzhik V, Voss H-J. Exponential families of nonisomorphic nontriangular orientble genus embeddings of complete graphs. J Combin Theorey Ser B, 86: 186–211 (2002)
Whitney H. 2-isomorphic graphs. Amer J Math, 55: 245–254 (1933)
Ringel G. Map Color Theorem. Berlin: Springer-Verlag, 1974
Liu Y P. Map color theorem and graph embeddings (in Chinese). Math Practice Theory, 1-5: 65–78, 59-69, 33-44, 33-41, 34-44 (1981-1982)
Lins S. A sequence representation for maps. Discrete Math, 30: 249–263 (1980)
Lawrencenko S. The irreducible triangulations of the torus (in Russian). Ukrain Geom SB, 30: 52–62 (1987)
Negami S. Uniqueness and faithfulness of embeddings of toroidal graphs. Discrete Math, 44: 161–180 (1983)
Lawrencenko S, Negami S, White A T. Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discrete Math, 135: 367–369 (1994)
Bonningtong C P, Grannel M J, Griggs T S, et al. Face 2-colourable triangular embeddings of complete graphs. J Combin Theory Ser B, 74: 8–19 (1998)
Bonningtong C P, Grannel M J, Griggs T S, et al. Exponential families of non-isomorphic triangulations of complete graphs. J Combin Theorey Ser B, 78: 169–184 (2000)
Korzhik V, Voss H-J. On the number nonisomorphic orientable regular embeddings of complete graphs. J Combin Theorey Ser B, 81: 58–76 (2001)
Korzhik V. Exponentially many triangular embeddings of K 12s . Preprint
Korzhik V. Exponentially many triangular embeddings of K 12s+3. Preprint
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Grant No. 10671073), Science and Technology commission of Shanghai Municipality (Grant No. 07XD14011) and Shanghai Leading Academic Discipline Project (Grant No. B407)
Rights and permissions
About this article
Cite this article
Ren, H., Bai, Y. Exponentially many maximum genus embeddings and genus embeddings for complete graphs. Sci. China Ser. A-Math. 51, 2013–2019 (2008). https://doi.org/10.1007/s11425-007-0194-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-007-0194-1