Eulerian and Hamiltonian Cycles in Graph Theory
Explore Eulerian cycles, Hamiltonian cycles, and the Knights Tour Problem in graph theory. Learn about the sufficiency conditions for Eulerian cycles, Hamiltons Around the World Game, and the fascinating connection between knights tours and Hamiltonian tours.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Graphs and Trees This handout: Eulerian Cycles: Sufficiency of the condition Hamiltonian tour
More on Eulers Theorem Theorem. An undirected graph has an eulerian cycle if and only if (1) every node degree is even and (2) the graph is connected (that is, there is a path from each node to each other node). Sufficiency of the condition Assume the result is true for all graphs with fewer than m arcs; show that it is true for a graph G=(V,A) with |A|=m. Start at some node, and take a walk until a cycle C is found. 1 4 4 7 7 3 3 5 5
More on Eulers Theorem Sufficiency of the condition Start at some node, and take a walk until a cycle C is found. Consider G = (V, A-C) the degree of each node is even there are several connected components So, G is a union of Eulerian cycles Connect G into a single eulerian cycle by adding C. 4 7 3 5
Hamiltonian Cycles A Hamiltonian cycle is a cycle that passes through each node of the graph exactly once.
Hamiltons Around the World Game In 1857, Irish mathematician William Rowan Hamilton invented a puzzle that he hoped would be very popular. The objective was to make what we just called a hamiltonian cycle. The game was not a commercial success. But the mathematics of hamiltonian cycles is very popular today.
The knights tour problem Can a knight visit all squares of a chessboard exactly once, starting at some square, and by making 63 legitimate moves? The knight s tour problem is a special case of the hamiltonian tour problem. The answer is yes!
