A Hamiltonian graph is a special type of graph in graph theory that possesses a Hamiltonian cycle. A Hamiltonian cycle is a cycle that visits every vertex of the graph exactly once and returns to the starting vertex