Advertisement

Graphs and Combinatorics

, Volume 32, Issue 4, pp 1329–1337 | Cite as

Hamilton Cycles in Implicit 2-Heavy Graphs

  • Junqing CaiEmail author
  • Hao Li
Original Paper

Abstract

Let id(v) denote the implicit degree of a vertex v in a graph G. We define G of order n to be implicit 2-heavy if at least two of the end vertices of each induced claw have implicit degree at least \(\frac{n}{2}\). In this paper, we show that every implicit 2-heavy graph G is hamiltonian if we impose certain additional conditions on the connectivity of G or forbidden induced subgraphs. Our results extend two previous theorems of Broersma et al. (Discret Math 167–168:155–166, 1997) on the existence of Hamilton cycles in 2-heavy graphs.

Keywords

Implicit degree Hamilton cycle Implicit 2-heavy 

Notes

Acknowledgments

The authors are very grateful to the anonymous referee whose helpful comments and suggestions have led to a substantially improvement of the paper.

References

  1. 1.
    Bondy, J.A.: Large cycles in graphs. Discret. Math. 1, 121–132 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bondy, J.A.: Longest paths and cycles in graphs of high degree. In: Research Report CORR 80-16. Univ. of Waterloo, Waterloo (1980)Google Scholar
  3. 3.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)CrossRefzbMATHGoogle Scholar
  4. 4.
    Broersma, H.J., Ryjáček, Z., Schiermeyer, I.: Dirac’s minimum degree condition restricted to claws. Discret. Math. 167–168, 155–166 (1997)CrossRefzbMATHGoogle Scholar
  5. 5.
    Broersma, H.J., Veldman, H.J.: Restrictions on induced subgaphs ensuring hamiltonicity or pancyclicity of \(K_{1,3}\)-free graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 181–194. BI-Wiss.-Verl., Mannhein (1990)Google Scholar
  6. 6.
    Faudree, R.J., Ryjáček, Z., Schiermeyer, I.: Forbidden subgraphs and cycle extendability. J. Comb. Math. Comb. Comput. 19, 109–128 (1995)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Li, H., Ning, W.T., Cai, J.Q.: An implicit degree condition for cyclability in graphs, FAW-AAIM 2011. LNCS 6681, 82–89 (2011)zbMATHGoogle Scholar
  8. 8.
    Oberly, D.J., Sumner, D.P.: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. J. Graph Theory 3, 351–356 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Yamashita, T.: On degree sum conditions for long cycles and cycles through specified vertices. Discret. Math. 308, 6584–6587 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Zhu, Y., Li, H., Deng, X.: Implicit-degrees and circumferences. Gr. Comb. 5, 283–290 (1989)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Japan 2015

Authors and Affiliations

  1. 1.School of ManagementQufu Normal UniversityRizhaoPeople’s Republic of China
  2. 2.L.R.I, UMR 8623CNRS, Université Paris-Sud 11OrsayFrance
  3. 3.Institute for Interdisciplinary ResearchJianghan UniversityWuhanPeople’s Republic of China

Personalised recommendations