Is hamiltonian graph a graph where a Cycle covers all the vertexes?

101 Views Asked by At

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?

1

There are 1 best solutions below

6
On BEST ANSWER

YES, by definition Hamiltonian cycle is a cycle that traverses all the vertices.