I learnt that , a Cycle should have unique vertices and unique edges where start vertex = end vertex.
So if the there is a Cycle that can cover every vertex, is that sufficient enough to make the graph HAMILTONIAN?
I learnt that , a Cycle should have unique vertices and unique edges where start vertex = end vertex.
So if the there is a Cycle that can cover every vertex, is that sufficient enough to make the graph HAMILTONIAN?
YES, by definition Hamiltonian cycle is a cycle that traverses all the vertices.