Explore tens of thousands of sets crafted by our community.
Eulerian and Hamiltonian Paths
10
Flashcards
0/10
Hamiltonian Path
A Hamiltonian Path is a path that visits each vertex of a graph exactly once. Existence conditions: No easy necessary and sufficient conditions, but Dirac's and Ore's theorems give sufficient conditions for Hamiltonian Paths in certain graphs.
Dirac's Theorem
Dirac's Theorem provides a condition for the existence of a Hamiltonian Circuit in a graph. It states that if a graph has vertices, and every vertex has degree at least , then the graph has a Hamiltonian Circuit.
Semi-Hamiltonian Graph
A Semi-Hamiltonian Graph has a Hamiltonian Path but not a Hamiltonian Circuit. Existence conditions: Sufficient conditions are similar to Hamiltonian Graphs but less restrictive, often related to graph connectivity and degree sequences.
Hamiltonian Circuit
A Hamiltonian Circuit is a Hamiltonian Path that starts and ends at the same vertex, forming a cycle. Existence conditions: No easy necessary and sufficient conditions exist, but a graph needs to be sufficiently connected to have a Hamiltonian Circuit.
Hamilton's Theorem
Hamilton's Theorem is a hypothesized theorem suggesting certain conditions under which a Hamiltonian Circuit would exist in a graph. It is important to note that no such general theorem has been proven.
Euler's Theorem for Graphs
Euler's Theorem states that a connected graph possesses an Eulerian Circuit if and only if every vertex has an even degree.
Eulerian Path
An Eulerian Path is a path that uses each edge of a graph exactly once. Existence conditions: For a connected graph, if exactly 0 or 2 vertices have odd degree, an Eulerian Path exists.
Semi-Eulerian Graph
A Semi-Eulerian Graph has an Eulerian Path but not an Eulerian Circuit. Existence conditions: The graph is connected and exactly two vertices have an odd degree.
Eulerian Circuit
An Eulerian Circuit is an Eulerian Path that starts and ends on the same vertex, thus forming a cycle. Existence conditions: For a connected graph, an Eulerian Circuit exists if and only if all vertices have even degree.
Ore's Theorem
Ore's Theorem is a criterion for the existence of a Hamiltonian Circuit in a graph. It states that if a graph has vertices, and for every pair of non-adjacent vertices and , the sum of their degrees is at least , then the graph has a Hamiltonian Circuit.
© Hypatia.Tech. 2024 All rights reserved.