A connected graph G is called Hamiltonian graph if there is a cycle which includes every vertex of G and the cycle is called
Hamiltonian cycle.
Hamiltonian walk in graph G is a walk that
passes through each vertex exactly once.
Examples of Hamiltonian Graph
Hamiltonian circuit:
Ae1Be2Ce3De4Ee5A
Hamiltonian circuit :
Ae1Be2Ce3De4Ee5A
.svg)
Hamiltonian circuit :
Ae1Be2Ce3De4Ee5A
Hamiltonian circuit :
Ae1Be2Ce3De4Ee5A
Hamiltonian circuit :
Ae1Be2Ce3De4Ee5F
e6Ge7He8Ie9A
