Decision Algorithm of Hamilton Graph
Zhao Yi-ping · Journal of Urumqi Adult Education Institute · 2006
The Hamiltonian problem is an important problem of graph theory .Although several sufficient conditions and requisite conditions have been found, they are not necessary and sufficient conditions,and what is more,using these above mentioned conditions to judge whether it is a Hamiltonian graph or not is not easy .This paper introduces an algorithm which could judge whether it is a Hamiltonian graph or not only based on the randomly given undirectional and simple connected graph.If it is a Hamiltonian graph, recirculating loop can also be made.