A graph G with number of vertices greater and equal than three i.e. (n ≥ 3) is a Hamiltonian graph, if the degree of each vertex is greater and equal to...
1
Equal to number of vertices
2
Double of number of vertices
3
Half of number of vertices
4
Four times of number of vertices