SCGIMT College By:- A. Ali (Asst.
Professor)
Practice Questions - Euler and Hamiltonian Paths
1. Determine if the following graph has an Euler circuit: A graph with vertices
{A, B, C, D, E} and edges {AB, BC, CD, DE, EA, AC, BD}
2. Does the complete graph K6 have a Hamiltonian cycle? If so, how many
distinct Hamiltonian cycles does it have?
3. For a graph G with 7 vertices, each of degree 4, determine if it has: a) An
Euler path b) A Hamiltonian path.
4. Consider the Petersen graph. How many edges need to be added to
create an Euler circuit?
5. Apply Ore's theorem to determine if this graph has a Hamiltonian cycle: A
graph with 6 vertices where the degree sum of any two non-adjacent vertices
is at least 6.
6. Does the complete bipartite graph K4,3 have: a) An Euler path, b) A
Hamiltonian cycle.
7. In a graph with 8 vertices, what's the minimum number of edges required
to guarantee the existence of a Hamiltonian cycle according to Dirac's
theorem?
8. A graph G has 10 vertices. Five vertices have degree 4, three vertices
have degree 3, and two vertices have degree 5. Does G have an Euler
circuit? If not, can it have an Euler path?
9. Prove or disprove: If a graph has a Hamiltonian cycle, it must also have an
Euler circuit.
10. Consider a graph G with 5 vertices and 7 edges. Is it possible for G to
have both an Euler circuit and a Hamiltonian cycle? Justify your answer.
Dirac's Theorem states that a simple graph with 'n' vertices (n ≥ 3) is
Hamiltonian if every vertex has a degree of at least n/2, while Ore's Theorem
is a generalization, stating a graph with 'n' vertices is Hamiltonian if, for every
pair of non-adjacent vertices 'u' and 'v', the sum of their degrees (deg(u) +
deg(v)) is at least 'n'. Ore's Theorem is a broader condition, as satisfying
Dirac's condition automatically satisfies Ore's condition, but not vice-versa.
Dirac's Theorem
Condition:For a graph with 'n' vertices (where n ≥ 3), if every vertex has a degree of
at least n/2, then the graph contains a Hamiltonian cycle.
Meaning:A Hamiltonian cycle is a path within the graph that visits every vertex exactly
once and returns to the starting vertex.
Example:In a graph with 10 vertices, if every vertex is connected to at least 5 other
vertices (10/2 = 5), then the graph is guaranteed to have a Hamiltonian cycle.
Ore's Theorem
Condition:For a graph with 'n' vertices, if for any pair of non-adjacent vertices 'u' and
'v', the sum of their degrees is at least 'n' (deg(u) + deg(v) ≥ n), then the graph has a
Hamiltonian cycle.
Meaning:This theorem provides a broader sufficient condition for a graph to be
Hamiltonian by looking at the combined degrees of non-connected vertex pairs.
Relationship to Dirac's Theorem:If a graph satisfies Dirac's condition (every vertex
has degree ≥ n/2), it also satisfies Ore's condition. To see this, take any two non-
adjacent vertices; since each has a degree of at least n/2, their sum will be at least n/2
+ n/2 = n, fulfilling Ore's requirement.
Key takeaway:
Both theorems provide sufficient conditions for a graph to be Hamiltonian.
Ore's Theorem is a generalization of Dirac's Theorem because it covers a
wider range of graphs that are guaranteed to be Hamiltonian
