Skip to main content
Log in

Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

On the basis of the joint tree model initiated in Liu (The non-orientable maximum genus of a graph (in Chinese), Scieulia Sinica, Special Issue on Math. I 191–201, 1979) and comprehensively described in Liu (Theory of Polyhedra (in English), Science Press, Beijing, 2008), this paper provides the numbers of topologically non-equivalent orientable embeddings of a new type of 3-regular graphs by genus via classifying the associate polyhegons.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bonnington C.P., Conder M., Morton M.: Embedding digraphs on orientable surfaces. J. Comb. Theory, Series B 85, 1–20 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen J., Gross J.L., Rieper R.G.: Overlap matrices and total imbedding distributions. Discret. Math. 128, 73–94 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Frechet M., Fan K.: Initiation to Combinatorial Topology. Prindle, Weber and Schmidt, Inc., Boston (1934)

    Google Scholar 

  4. Furst M.L., Gross J.L., Statman R.: Genus distribution for two classes of graphs. J. Combin. Theory B 46, 22–36 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gross J.L., Furst M.L.: Hierarcy of imbedding distribution invariants of a graph. J. Graph Theory 11, 205–220 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hao R.X., Liu Y.P.: The genus distributions of directed antiladders in orientable surfaces. Appl. Math. Lett. 21, 161–164 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Jackson D.M.: Counting cycles in permutations by group characters with an application to a topological problem. Trans. Amer. Math. Soc. 299, 785–801 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kwak J.H., Shim S.H.: Total embedding distributions for bouquets of circles. Discret. Math. 248, 93–108 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Liu, Y.P.: The nonorientable maximum genus of a graph. Sci. China, Ser. A, 191–201 (1979) (in Chinese, 1979-S1)

  10. Liu Y.P.: Theory of Polyhedra. Science Press, Beijing (2008)

    Google Scholar 

  11. Tesar E.H.: Genus distribution of Ringel ladders. Discret. Math. 216, 235–252 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Thomassen C.: The graph genus problem is NP-complete. J. Assoc. Comput. Mach. Algorithms 10, 568–576 (1989)

    MATH  MathSciNet  Google Scholar 

  13. Visentin, T.I., Wieler, S.W.: On the genus distribution of (p,q,n)-dipoles. Electron. J. Comb. 14, R12 (2007)

  14. Wan L.X., Liu Y.P.: On the embedding genus distribution of ladders and crosses. Appl. Math. Lett. 22(5), 738–742 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zeng J.C., Liu Y.P.: A genus inequality of the union graphs. Ars Combin. 92, 445–452 (2009)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianchu Zeng.

Additional information

Supported by NNSFC under Grant 10871021, 70661001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeng, J., Liu, Y. & Hao, R. Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph. Graphs and Combinatorics 28, 133–142 (2012). https://doi.org/10.1007/s00373-011-1029-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-011-1029-y

Keywords

Mathematics Subject Classification (2000)

Navigation