Annals of Operations Research

, Volume 261, Issue 1–2, pp 393–399 | Cite as

A note on using the resistance-distance matrix to solve Hamiltonian cycle problem

  • V. Ejov
  • J. A. Filar
  • M. HaythorpeEmail author
  • J. F. Roddick
  • S. Rossomakhine
Short Note


An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult instances, choosing the edge weights to be the resistance distance between its two incident vertices is often a good choice. We also demonstrate that arguably stronger performance arises from using the inverse of the resistance distance. Examples are provided demonstrating benefits gained from these choices.



This work was supported by Australian Research Council Grants LP110100166 and DP150100618. We would also like to thank the anonymous reviewers whose suggestions helped to improve this paper.


  1. Aldred, R. E. L., & Holton, D. (1999). Planar graphs, regular graphs, bipartite graphs and hamiltonicity. Australasian Journal of Combinatorics, 20, 111–131.Google Scholar
  2. Alguliev, R., Aliguliyev, R., & Ganjaliyev, F. (2011). Investigation the role of similarity measure and ranking algorithm in mining social network. Journal of Information Science, 37, 229–234.CrossRefGoogle Scholar
  3. Applegate, D. L., Bixby, R. B., Chavátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton: Princeton University Press.Google Scholar
  4. Babić, D., Klein, D. J., Lukovits, I., Nikolić, S., & Trinajstić, N. (2002). Resistance-distance matrix: A computational algorithm and its application. International Journal of Quantum Chemistry, 90(1), 166–176.CrossRefGoogle Scholar
  5. Baniasadi, P., Ejov, V., Filar, J. A., Haythorpe, M., & Rossomakhine, S. (2014). Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem. Mathematical Programming Computation, 6(1), 55–75.CrossRefGoogle Scholar
  6. Bapat, R. B. (2010). Graphs and matrices. Berlin: Springer.CrossRefGoogle Scholar
  7. Chalaturnyk. A. (2008). A Fast Algorithm For Finding Hamilton Cycles. Masters Thesis, University of Manitoba.Google Scholar
  8. Chennubhotla, C., & Bahar, I. (2007). Signal propagation in proteins and relation to equilibrium fluctuations. PLoS Computational Biology, 3, 1716–1726.Google Scholar
  9. Doyle, P. G., & Snell, J. L. (1984). Random walks and electric networks. Mathematical Association of America.Google Scholar
  10. Eppstein, D. (2003). The traveling salesman problem for cubic graphs. In F. Dehne, J. R. Sack & M. Smid (Eds.), Algorithms and data struct., volume 2748 of Lecture Notes in Computer Science, (pp. 307–318). Berlin: Springer.Google Scholar
  11. Fleischner, H. (2014). Uniquely Hamiltonian graphs of minimum degree 4. Journal of Graph Theory, 75(2), 167–177.CrossRefGoogle Scholar
  12. Fowler, P. W. (2002). Resistance distances in fullerene graphs. Croatica Chemica Acta, 75(2), 401–408.Google Scholar
  13. Frieze, A., & Haber, S. (2015). An almost linear time algorithm for finding Hamiltonian cycles in sparse random graphs with minimum degree at least three. Random Structures and Algorithms, 47(1), 73–98.CrossRefGoogle Scholar
  14. Haythorpe, M. (2016). On the minimum number of Hamiltonian cycles in regular graphs. Experimental mathematics, to appear, 2017. doi: 10.1080/10586458.2017.1306813.
  15. Helsgaun, K. (2000). An effective implementation of Lin–Kernighan traveling salesman heuristic. European Journal of Operations Research, 126, 106–130.CrossRefGoogle Scholar
  16. Isaacs, R. (1975). Infinite families of non-trivial trivalent graphs which are not Tait colorable. American Mathematical Monthly, 82, 221–239.CrossRefGoogle Scholar
  17. Klein, D. J., & Randić, M. (1993). Resistance distance. Journal of Mathematical Chemistry, 12(1), 81–95.CrossRefGoogle Scholar
  18. Lukovits, I., Nikolić, S., & Trinajstić, N. (1999). Resistance distance in regular graphs. International Journal of Quantum Chemistry, 71(3), 217–225.CrossRefGoogle Scholar
  19. McRae, B. H., & Beier, P. (2007). Circuit theory predicts gene flow in plant and animal populations. Proceedings of the National Academy of Sciences of the United States of America, 104(50), 19885–19890.CrossRefGoogle Scholar
  20. Palacios, J. L. (2001). Closed-form formulas for Kirchhoff index. International Journal of Quantum Chemistry, 81(2), 135–140.CrossRefGoogle Scholar
  21. Rao, D., Yarowsky, D., & Callison-Burch, C. (2008). Affinity measures based on the graph Laplacian. In Proceeding of the 3rd Textgraphs workshop on graph-based algorithms for natural language processing (pp. 41–48). Association for Computation Linguistics.Google Scholar
  22. Spielman, D. A., & Srivastava, N. (2011). Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6), 1913–1926.CrossRefGoogle Scholar
  23. Tizghadam, A., & Alberto, L.-G. (2010). Betweenness centrality and resistance distance in communication networks. IEEE Network, 24(6), 10–16.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Flinders UniversityClovelly ParkAustralia
  2. 2.School of Mathematics and PhysicsUniversity of QueenslandSt LuciaAustralia

Personalised recommendations