What is Hamiltonian Graph?
Hamiltonian Graph is a connected graph that contains a Hamiltonian Circuit. It means there exists a simple circuit in the graph that visits each vertex exactly once.
- The above graph contains a cycle a-b-c-f-d-e-a that visits each vertex exactly once. Therefore, the cycle is a hamiltonian circuit.
- This implies that the graph is a Hamiltonian Graph.
- There exists a cycle in the graph that visits all vertices, a-b-d-c-f-d-e-a but vertex d appears twice in the cycle. Thus, it is not a Hamiltonian circuit.
- The graph doesn’t contain a hamiltonian circuit. This implies that the graph is a Nonhamiltonian Graph.
- The graph consists of 2 connected components – K1 and K2.
- The two components are Hamiltonian but the graph as a whole is not.
- We cannot reach from K1 to K2. No cycle can exist that visits all vertices of the graph.
- Thus, the Graph is not hamiltonian.
- The graph contains a Hamiltonian Path: e-a-b-d-c-f that visits each vertex exactly once but no cycle is formed. Thus, the graph is not Hamiltonian.
- Every hypercube is a Hamiltonian.
- Every cycle graph is Hamiltonian.
- Every wheel graph is Hamiltonian.
- Every complete graph ( v >= 3 ) is Hamiltonian.
- Every complete bipartite graph ( except K1,1 ) is Hamiltonian.
Properties of Hamiltonian Graph
- Every Hamiltonian Graph contains a Hamiltonian Path but a graph that contains Hamiltonian Path may not be Hamiltonian Graph.
- Every Hamiltonian Graph is a Biconnected Graph. It means that if we remove any vertex from the graph, the graph will remain connected. The graph may or may not remain Hamiltonian after removing the vertex. For example, if we remove a vertex from a cycle graph, the graph remains connected but it is no longer hamiltonian.
Applications of Hamiltonian Graph
- Hamiltonian Graph can be used to find the most appropriate networks between different cities for road networking, pipelining purpose, etc.