Khaliluzzaman, Md.; Islam, Md. Monirul; Hasan, Md.Monjur
(International Journal of Computer Applications, 2015-05)
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is called a Hamiltonian cycle of G and G is said to be a Hamiltonian graph. A Hamiltonian path is a path that contains all the ...