On the Hamiltonian-Connectedness for Graphs Satisfying Ore’s Theorem

  • Yuan-Kang Shih
  • Hsun Su
  • Shin-Shin Kao
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 20)


Consider any undirected and simple graph G = (V,E), where V and E denote the vertex set and the edge set of G, respectively. Let |G| = |V| = n ≥ 3. The well-known Ore’s theorem states that if deg G (u) + deg G (v) ≥ n holds for each pair of nonadjacent vertices u and v of G, then G is hamiltonian. A similar theorem given by Erdös is as follows: if deg G (u) + deg G (v) ≥ n + 1 holds for each pair of nonadjacent vertices u and v of G, then G is hamiltonian-connected. In this paper, we improve both theorems by showing that any graph G satisfying the condition in Ore’s theorem is hamiltonian-connected unless G belongs to two exceptional families.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bondy, J.A., Mutry, U.S.R.: Graph Theory with Applications. North-Holland, New York (1980)Google Scholar
  2. 2.
    Erdös, P., Gallai, T.: On Maximal Paths and Circuits of Graphs. Acta Mathematica Hungarica 10, 337–356 (1959)MATHGoogle Scholar
  3. 3.
    Kao, S.S., Hsu, K.M., Hsu, L.H.: Cubic planar hamiltonian graphs of various types. Discrete Mathematics 309, 1364–1389 (2006)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ore, O.: Note on Hamilton Circuit. American Mathematical Monthly 67, 55 (1960)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Su, H., Shih, Y.-K., Kao, S.-S.: On the 1-fault hamiltonicity for graphs satisfying Ore’s theorem. Information Processing Letters 112, 839–843 (2012)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Zhao, K., Chen, D., Lin, Y., Li, Z., Zeng, K.: Some new sufficient conditions and Hamiltonian-connected graphs. Procedia Engineerig 24, 278–281 (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yuan-Kang Shih
    • 1
  • Hsun Su
    • 2
  • Shin-Shin Kao
    • 3
  1. 1.Intel-NTU Connected Context Computing CenterNational Taiwan UniversityTaipeiTaiwan, R.O.C.
  2. 2.Department of Public Finance and TaxationTakming University of Science and TechnologyTaipei CityTaiwan, R.O.C.
  3. 3.Department of Applied MathematicsChung Yuan Christian UniversityChung-Li CityTaiwan, R.O.C.

Personalised recommendations