In a connected graph, a closed walk that visits every vertex of the graph (G) exactly once, except the starting and ending vertices, is called a Hamiltonian cycle.
The example below is not the Hamiltonian cycle because you cannot visit each vertex without breaking the visiting every node once rule.