In: Statistics and Probability
What is the difference between a Eulerian Path and Circuit? What is the difference between a Hamiltonian Path and Circuit? Is the image below Eulerian or Hamiltonian, Path or Circuit? How did you determine your answer?
Euler paths and circuits :
Hamiltonian paths and circuits :
Hamilonian Path – A simple path in a graph that passes through every vertex exactly once is called a Hamiltonian path.
Hamilonian Circuit – A simple circuit in a graph that passes through every vertex exactly once is called a Hamiltonian circuit.
Unlike Euler paths and circuits, there is no simple necessary and sufficient criteria to determine if there are any Hamiltonian paths or circuits in a graph. But there are certain criteria which rule out the existence of a Hamiltonian circuit in a graph, such as- if there is a vertex of degree one in a graph then it is impossible for it to have a Hamiltonian circuit.