Hamiltonian Approach for Finding Shortest Path

Authors

  • M. Tamilarasi  M.Phil Scholar, Department of Computer Science, Alagappa University, Karaikudi, Tamil Nadu, India
  • Dr. S. S. Dhenakaran  Professor, Department of Computer Science, Alagappa University, Karaikudi, Tamil Nadu, India

Keywords:

Hamiltonian Circuit, Shortest Path, Time, Cost

Abstract

Hamiltonian problem is important branch of graph theory in mathematics and computer science. Need of finding shortest path is increased. The aim of the work is to find the shortest Hamiltonian path from a weighted complete graph. It is easy to understand and very useful in real life such as shortest route on road from home to hospital, social network, pizza delivery, mail delivery, gas delivery, tour travel and school bus travel etc. Due to exact timing delivery, the popularity of enterprise is increased and boom the clients, offerings and earnings. The objective of the work is to find shortest path using Hamiltonian technique from a weighted graph.

References

  1. Wadee Alhalabi , Omar Kitannah , Amira Alharbi, Zain Balfakin and Akila Sarirete., “Efficient solution for finding Hamiltonian cycles in undirected graph”, SpringPlus(2016), 5:11:92.
  2. M Radhika ., “A Comparative Study Between Eulerian And Hamiltonian Graphs”, IJETST-Vol.03,Issue,05,Page 435-439,May,ISSN 2348-9480,2016.
  3. Dipak Patel,Nishant Doshi,Shakthi Patel,Dishant Soni., “Hamiltonian cycle and TSP:A backtracking approach”,InternationalJournal on Computerscience and Engineering(IJCSE),Vol.3,No.4,Apr 2011.
  4. Dajin Wang., “On Embedding Hamiltonian Cycles in Crossed Cubes”, IEEE Transaction on Parallel and Distributed Systems”, Vol.19, No.3, March 2008,
  5. Vidhi Sutaria., “Hamiltonian and Eulerian Cycles”, International Journal of Trend in Research and Development,Vol.3,ISSN:2394-9333.
  6. Ref:Courses.Lumenlearning Visited on 19:5:18
  7. ANagoor Gani and S.R.Latha., “A new algorithm to find fuzzy Hamiltonian cycle in a fuzzy network using adjacency matrix and minimum vertex degree”,SpringPlus(2016).
  8. MSohel Rahman,M.Kaykobadn and Jesun Sahariar Firoz., “New Sufficient Conditions for Hamiltonian Paths”,Hindawi Publishing Corporation Scientific World Journal,Vol 2014.
  9. Mushtaq Ahmad Stah., “A study on hypo Hamiltonian graphs”,African journal of Mathematics and Computer Science Research,Vol.6(2),pp.16-19,February 2013.
  10. Dr.G.Nirmala,M.Vijaya., “Hamiltonian fuzzy Cycles on k 2n+1 Fuzzy Graphs”,Internatonal journal of scientific and Research Publications,Volume 2,Issue 11,November 2012.

International Journal of Scientific Research in Science and Technology

Downloads

Published

2018-06-30

Issue

Volume 4, Issue 8, May-June-2018

Section

Research Articles

License

Copyright (c) IJSRST

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
M. Tamilarasi, Dr. S. S. Dhenakaran, " Hamiltonian Approach for Finding Shortest Path, International Journal of Scientific Research in Science and Technology(IJSRST), Online ISSN : 2395-602X, Print ISSN : 2395-6011, Volume 4, Issue 8, pp.484-488, May-June-2018.