what is hamiltonian cycle ?
In a connected graph ,a closed walk that vists every vertex of the graph G exactly once except the starting and ending vertices .it is called hamiltonian cycle.
what is hamiltonian path?
In a connected graph ,an open walk that visits every vertex of the graph G exactly once.but it containan open walk.
what is hamiltonian graph?
A graph G is said to be hamiltonian graph if it contain a hamiltonian cycle.
Top comments (0)