Annals of Combinatorics

, Volume 13, Issue 4, pp 403–412

Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian

Open Access
Article

Abstract

We consider the spectral and algorithmic aspects of the problem of finding a Hamiltonian cycle in a graph. We show that a sufficient condition for a graph being Hamiltonian is that the nontrivial eigenvalues of the combinatorial Laplacian are sufficiently close to the average degree of the graph. An algorithm is given for the problem of finding a Hamiltonian cycle in graphs with bounded spectral gaps which has complexity of order ncln n.

AMS Subject Classification

05C45 

Keywords

Hamiltonian combinatorial Laplacian spectral graph theory 

References

  1. 1.
    Alon N., Spencer J.H.: The Probabilistic Method, 2nd Ed. Wiley, New York (2000)MATHGoogle Scholar
  2. 2.
    Applegate D., Bixby R., Chvátal V., Cook W.: On the solution of traveling salesman problems. Doc. Math. 3, 645–656 (1998)Google Scholar
  3. 3.
    Chang H.-W., Hwang F.K., Lee J.S.: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9, 398–423 (1993)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Chung, F.: Discrete isoperimetric inequalities. In: Surveys in Differential Geometry, vol. IX, pp. 53–82. International Press, Somerville (2004)Google Scholar
  5. 5.
    Dirac G.A.: Hamiltonian circuits and long circuits. Ann. Discrete Math. 3, 75–92 (1978)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Held M., Karp R.M.: The traveling-salesman problem and minimum spanning trees. Operation Res. 18, 1138–1162 (1970)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Karp R.M.: Reduciblity among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Comoplexity of Computer Computations, pp. 85–103. Plenum, New York (1972)Google Scholar
  8. 8.
    Komlós, J., Szemerédi, E.: Hamilton cycles in random graphs. In: Infinite and finite sets, vol. II, pp. 1003–1010. North-Holland, Amsterdam (1975)Google Scholar
  9. 9.
    Krivelevich M., Sudakov B.: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42, 17–33 (2003)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Pósa L.: Hamiltonian circuits in random graphs. Discrete Math. 14, 359–364 (1976)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization—Eureka, You shrink!, pp. 185–207. Springer, New York (2003)Google Scholar

Copyright information

© The Author(s) 2009

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of CaliforniaLos AngelesUSA
  2. 2.Department of MathematicsUniversity of CaliforniaSan Diego, La JollaUSA

Personalised recommendations