Graph Theory: Euler Circuits Christina Mende Math 480 April 15, 2013

Preliminaries  A graph is a pair G=(V,E) of sets satisfying  The elements of V are the vertices of our graph.  The elements of E are the edges of our graph. a b c d V={a,b,c,d} E={{a,b},{a,c},{b,c},{c,d}}

Preliminaries  The degree of a vertex v (denoted deg(v)) is the number of edges directly connected to that vertex. a b c d V={a,b,c,d} E={{a,b},{a,c},{b,c},{c,d}} deg(a)=2deg(b)=2 deg(c)=3deg(d)=1

Preliminaries  A path of length n>0 is a sequence of edges that begins at a vertex of the graph and travels from vertex to vertex along the edges of a graph.  If a path begins and ends at the same vertex, it is called a closed path or circuit. a b c d e.g. a,b,c,d is a path a,b,c,a is a circuit.

Preliminaries  A graph is connected if it cannot be expressed as the union of two graphs a b c d Connected Disconnected G1G1 G2G2 In other words, a graph is connected if there is a path between every distinct vertex of the graph.

The Seven Bridges of Königsberg Question: Is it possible to start at some location in town, travel across all seven bridges without crossing any bridge twice, and return to the same starting point? A C B D Multigraph model of Seven Bridges of Konigsberg.

Euler Circuits  A connected graph G is called Eulerian if there exists a closed path which includes every edge of G. Note that this means each edge must be traversed once and only.  Such a path is called an Eulerian circuit.

Euler Circuits  Theorem: A connected graph G is Eulerian if and only if the degree of every vertex of G is even. A C B D

Euler Paths Constructions: Fleury’s Algorithm  If G is an Eulerian graph, then we can always construct an Euler circuit for G using the following algorithm.  Pick any vertex v to start and traverse the edges in an arbitrary manner, subject to the following rules: 1. Erase the edges as they are traversed, 2. Never cross a bridge of the reduced graph unless there is no other choice, 3. Avoid edges that will prematurely end the circuit. Note: a bridge is an edge such that, if you cross it, the remaining graph will be disconnected.

Fleury’s Algorithm  Pick any vertex v to start and traverse the edges in an arbitrary manner, subject to the following rules: 1. Erase the edges as they are traversed, 2. Never cross a bridge of the reduced graph unless there is no other choice, 3. Avoid edges that will prematurely end the circuit.

Hierholzer’s Algorithm 1. Pick any vertex v to start 2. From v, pick an edge to traverse, (remember to darken those edges), and continue until you return to the starting vertex v. 3. If you have traveled through all the edges, you’re done! 4. If not, pick any vertex from the the darkened graph that still has edges not traveled and repeat step 2 using this new vertex. 5. Splice together the two circuits. If you have traveled all the edges of the graph, you’re done. If not, repeat the process. A B C DE F G A, C, F, D, A F, G, B, D, G, E, B, A, F Completed Euler Circuit: A, C, F, G, B, D, G, E, B, A, F, D, A Circuit 1: Circuit 2:

Any Questions? Image from:  References  R. Diestel, Graph Theory.  L.R. Foulds, Graph Theory Applications.  K. Rosen, Discrete Mathematics and Its Applications.  R. Wilson, Introduction To Graph Theory.