Hamiltonian Cycle problem is NP-Complete

Now lets prove that the Hamiltonian cycle problem is NP-Complete simply by proving first that it is an NP problem and then, reduce a well known NP-Complete (3-SAT) problem into this problem in poly-time.