Hamiltonian Graph 

Hamiltonian Graph (Concentrate on Vertices)

·        A Hamiltonian graph is a type of graph that contains a Hamiltonian cycle.

o   A Hamiltonian cycle is a cycle that visits each vertex in the graph exactly once and returns to the starting vertex.

o   In simpler terms, it's a closed path that goes through all the vertices of the graph without repeating any vertex, except for the start and end vertices, which are the same.

·        Hamiltonian Graph:

o   A graph that contains a Hamiltonian cycle is called a Hamiltonian graph.

o   Not all graphs are Hamiltonian.

o   The existence of a Hamiltonian cycle is a property that depends on the specific structure and connectivity of the graph.

·        Hamiltonian Cycle:

o   A Hamiltonian cycle is a cycle in a graph that visits every vertex exactly once and returns to the starting vertex.

o   If a graph contains a Hamiltonian cycle, it is said to be Hamiltonian.

·        Hamiltonian Path:

o   A Hamiltonian path is similar to a Hamiltonian cycle, but it is not a closed cycle. It is a path that visits each vertex exactly once but does not necessarily return to the starting vertex.

·       

·       

·       

In simple words:

·        It is a connected graph, with a closed walk, where all each vertex will be visited once exactly once except terminal vertex.