Skip to main content

Uniquely Bipancyclic Graphs

  • Chapter
  • First Online:
Pancyclic and Bipancyclic Graphs

Part of the book series: SpringerBriefs in Mathematics ((BRIEFSMATH))

  • 561 Accesses

Abstract

In this chapter we look at the problem of uniquely bipancyclic graphs, that is bipartite graphs that contain exactly one cycle of each length from 4 up to the number of vertices. If such a graph contains c cycles, their lengths are 4, 6, , 2c + 2, so the graph has 2c + 2 vertices; moreover the sum of the lengths of the cycles (total number of edges in the cycles, with multiple appearances in different cycles counted multiply) is \(4 + 6 + \cdots + (2c + 2) = c^{2} + 3c\). We shall denote this by s(c).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D. Amar, E. Flandrin, I. Fournier, A. Germa, Pancyclism in Hamiltonian graphs. Discrete Math. 89, 111–131 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Bauer, E. Schmeichel, Hamiltonian degree conditions which imply a graph is pancyclic. J. Comb. Theory (B) 48, 111–116 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. J.A. Bondy, Pancyclic graphs I. J. Comb. Theory (B) 11, 80–84 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  4. J.A. Bondy, Pancyclic graphs: recent results. Colloq. Math. Soc. János Bolyai, 181–187 (1973)

    Google Scholar 

  5. J.A. Bondy, Longest paths and cycles in graphs of high degree. Research Report CORR 80-16, University of Waterloo, Waterloo, Ontario (1980)

    Google Scholar 

  6. R.L. Brooks, On coloring the nodes of a graph. Proc. Camb. Philos. Soc. 37, 194–197 (1941)

    Article  MATH  MathSciNet  Google Scholar 

  7. W.K. Chen, On vector spaces associated with a graph. SIAM J. Appl. Math. 20, 385–389 (1971)

    Article  MathSciNet  Google Scholar 

  8. V. Chvátal, On Hamilton’s ideals. J. Comb. Theory (B) 12, 163–168 (1972)

    Article  MATH  Google Scholar 

  9. G.A. Dirac, Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  10. R.C. Entringer, E.F. Schmeichel, Edge conditions and cycle structure in bipancyclic graphs. Ars. Comb. 26, 229–232 (1988)

    MATH  MathSciNet  Google Scholar 

  11. G.-H. Fan, New sufficient conditions for cycles in graphs. J. Comb. Theory (B) 37, 221–227 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  12. I. Fourneir, P. Fraisse, One a conjecture of Bondy. J. Comb. Theory (B) 39, 17–26 (1985)

    Article  MATH  Google Scholar 

  13. J.C. George, A. Marr, W.D. Wallis, Minimal pancyclic graphs. J. Comb. Math. Combin. Comput. 86, 125–133 (2013)

    MATH  MathSciNet  Google Scholar 

  14. W. Goddard, M.A. Henning, Note: pancyclicity of the prism. Discrete Math. 234, 139–142 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. R. Gould, Graphs and vector spaces. J. Math. Phys. 37, 193–214 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Griffin, Minimal pancyclicity (to appear)

    Google Scholar 

  17. R. Häggkvist, Odd cycles of specified length in nonbipartite graphs. Ann. Discrete Math. 62, 89–99 (1982)

    MATH  MathSciNet  Google Scholar 

  18. W. Imrich, S. Klavzar, Product Graphs, Structure and Recognition (Wiley, New York, 2000)

    MATH  Google Scholar 

  19. S. Janson, T. Łuczak, A. Ruciński, Random Graphs (Wiley, New York, 2000)

    Book  MATH  Google Scholar 

  20. P.K. Jha, Kronicker products of paths and cycles: decomposition, factorization, and bi-pancyclicity. Discrete Math. 182, 153–167 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. A. Khodkar, A. Peterson, C. Wahl, Z. Walsh, Uniquely bipancyclic graphs on more than 30 vertices. J. Comb. Math. Combin. Comput. (to appear)

    Google Scholar 

  22. C. Lai, Graphs without repeated cycle lengths. Aust. J. Comb. 27, 101–105 (2003)

    MATH  MathSciNet  Google Scholar 

  23. K. Markström, A note on uniquely pancyclic graphs. Aust. J. Comb. 44, 105–110 (2009)

    MATH  MathSciNet  Google Scholar 

  24. J. Mitchem, E.F. Schmeichel, Pancyclic and bipancyclic graphs – a survey, in Proceedings of the First Colorado Symposium on Graph Theory, ed. by F. Harary, J.S. Maybee (Wiley, New York, 1985), pp. 271–278.

    Google Scholar 

  25. O. Ore, Note on Hamilton circuits. Am. Math. Month. 67, 55 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  26. N.C.K. Phillips, W.D. Wallis, Uniquely bipancyclic graphs on thirty-two vertices. J. Discrete Math. Sci. Crypt. (to appear)

    Google Scholar 

  27. S. Ramachandran, R. Parvathy, Pancyclicity and extendability in strong products. J. Graph Theory 22, 75–82 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  28. E.F. Schmeichel, S.L. Hakimi, Pancyclic graphs and a conjecture of Bondy and Chvatal. J. Comb. Theory (B) 17, 22–34 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  29. E.F. Schmeichel, J. Mitchem, Bipartite graphs with cycles of all even lengths. J. Graph Theory 6, 429–439 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  30. Y. Shi, Some theorems of uniquely pancyclic graphs. Discrete Math. 59, 167–180 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  31. Y. Shi, The number of cycles in a Hamilton graph. Discrete Math. 133, 249–257 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  32. M.R. Sridharan, On an extremal problem concerning pancyclic graphs. J. Math. Phys. Sci. 12, 297–306 (1978)

    MATH  MathSciNet  Google Scholar 

  33. K. Thulasiraman, M.N.S. Swamy, Graphs: Theory and Algorithms (Wiley, New York, 1992)

    Book  MATH  Google Scholar 

  34. W.D. Wallis, A Beginner’s Guide to Graph Theory, 2nd edn. (Birkhäuser, Boston, MA, 2007)

    Book  MATH  Google Scholar 

  35. W.D. Wallis, Uniquely bipancyclic graphs. J. Comb. Math. Comb. Comput. (to appear)

    Google Scholar 

  36. D.B. West, An Introduction to Graph Theory, 2nd edn. (Prentice-Hall, Englewood Cliffs, NJ, 2001)

    Google Scholar 

  37. H. Whitney, On the abstract properties of linear dependence. Am. J. Math. 57, 509–533 (1935)

    Article  MATH  MathSciNet  Google Scholar 

  38. C.T. Zamfirescu, (2)-Pancyclic graphs. Discrete Appl. Math. 161, 1128–1136 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

George, J.C., Khodkar, A., Wallis, W.D. (2016). Uniquely Bipancyclic Graphs. In: Pancyclic and Bipancyclic Graphs. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-31951-3_7

Download citation

Publish with us

Policies and ethics