Ans :
A cycle C in a graph G is called a Hamiltonian cycle if it contains all the
vertices of G. A graph is called Hamiltonian if it contains a Hamiltonian cycle. A
graph is called non-Hamiltonian if it is not Hamiltonian.
IgnouGroup Social Campus
Ans :
A cycle C in a graph G is called a Hamiltonian cycle if it contains all the
vertices of G. A graph is called Hamiltonian if it contains a Hamiltonian cycle. A
graph is called non-Hamiltonian if it is not Hamiltonian.