2m. The length of a Hamiltonian walk in G is denoted by h(G). Therefore, for a connected graph G of order n ≥ 3 , it folloes that h(G) = n if and only if G is Hamiltonian. The concept of a Hamiltonian walk was introduced by by Seymour Goodman and Stephen Hedetniemi in 1973