1. Excursions in Modern Mathematics Sixth Edition
Peter Tannenbaum

2. Chapter 5 Euler Circuits
The Circuit Comes to Town

3. Euler Circuits Outline/learning Objectives
To identify and model Euler circuit and Euler path problems.
To understand the meaning of basic graph terminology.

4. Euler Circuits Closing Task
Given a graph, I will identify the defining characteristics of a graph and identify any paths.

5. 5.1 Euler Circuit Problems
Euler Circuits
5.1 Euler Circuit Problems

6. Euler Circuits What is a routing problem? Existence question
Is an actual route possible?
Optimization question
Of all the possible routes, which one is the optimal route?

7. Euler Circuits
We will answer both the existence and optimization questions
for a special class of routing problems known as Euler circuit
problems. The common thread is what we call the exhaustion
requirement.

8. Euler Circuits
Most applications of Euler Circuits are to optimizing routes.
Start and finish at same location covering each path only once.
Start and finish at different locations, some paths must be crossed in both directions.
Start and finish at different locations, each route only crossed once.

10. Euler Circuits
Why is optimizing routes so important? What are you optimizing?

11. Euler Circuits The name of the game is to trace each drawing
without lifting the pencil or retracing any of the lines.
These kinds of tracings are called unicursal tracings.

12. Euler Circuits When we end in the same place we started, we call it
a closed unicursal tracing; when we start and end in
different places, we call it an open unicursal tracing. .

13. Euler Circuits
5.2 Graphs

14. Euler Circuits A graph is a picture consisting of: Vertices- dots
Edges- lines
The edges do not have to be straight lines. But they have to connect two vertices.
Loop- an edge connecting a vertex back with itself

15. Euler Circuits
Graphs
A graph is a structure that defines pairwise relationships within a set to objects. The objects are the vertices, and the pairwise relationships are the edges: X is related to Y if and only if XY is an edge.

16. Euler Circuits Name the vertices. Name the edges.
{A, B, C, D, E, F}
Name the edges.
{AB,AD, BC, BE, ED, CD}
F is an isolated vertex
CD has multiple edges.

17. Euler Circuits Adjacent vertices. Degree of vertex Odd vertex
Edge joins them.
Degree of vertex
# of edges
Odd vertex
Odd # of edges
Even vertex
Even # of edges.

18. Euler Circuits
This is considered a single graph, even though it consists of two separate, disconnected pieces. Such graphs are called disconnected graph, and the individual pieces are called the components of the graph..

19. Euler Circuits
A Graph with No Edges? Yes, its possible. Without edges, every vertex of the graph is an isolated vertex.

20. Euler Circuits Adjacent vertices. Are the following adjacent? B and E
C and D
E and E

21. Euler Circuits Adjacent edges.
Two edges are adjacent if they share a common vertex.

22. Euler Circuits Degree of a vertex.
The degree of a vertex is the number of edges at that vertex. When there is a loop at the vertex, the loop contributes twice.

23. Euler Circuits Odd and even vertices.
An odd vertex is a vertex of odd degree; an even vertex is a vertex of even degree. The graph has two even vertices (D and E) and six odd vertices (all the others).

24. Euler Circuits Odd and even vertices.
An odd vertex is a vertex of odd degree; an even vertex is a vertex of even degree.
Name the degree of each vertex and state whether it is odd or even.

25. Euler Circuits The deg(A) = 3 odd deg(B) = 5 odd deg(C) = 3 odd
deg(D) = 2 even
deg(E) = 4 even
deg (F) = 3 odd
deg (G) = 1 odd
deg (H) = 1 odd

26. Euler Circuits
Paths.
A path is a sequence of vertices with the property that each vertex in the sequence is adjacent to the next one. The key requirement in a path is that an edge can be part of a path only once.

27. Euler Circuits Paths (continued).
The number of edges in the path is called the length of the path.
A, B, E, D. This is a path from vertex A to D, consisting of the edges AB, BE, and ED. The length of this path is 3.

28. Euler Circuits Circuits.
A circuit has the same definition as a path, but has the additional requirement that the trip starts and ends at the same vertex.

29. Euler Circuits Connected graphs.
A graph is connected, if given any two vertices, there is a path joining them. A graph that is not connected is said to be disconnected. A disconnected graph is made up of separate components.

30. Euler Circuits Bridges.
Sometimes in a connected graph there is an edge such that if we were to erase it, the graph would become disconnected—such an edge is called a bridge. BF, FG, and FH are bridges.

31. Euler Circuits Euler paths.
An Euler path is a path that passes through every edge of a graph once and only once. The graph shown in (a) does not have an Euler path; the graph in (b) has several Euler paths. One of them is L,A,R,D,A,R,D,L,A.

32. Euler Circuits Euler circuits.
An Euler circuit is a circuit that passes through every edge of a graph. One of them is L,A,R,D,A,R,D,L,A,L.
Note that if a graph has an Euler circuit it cannot have an Euler path, and vice versa.

33. Euler Circuits
5.4 Graph Models

34. Euler Circuits
The notion of using a mathematical concept to describe and
solve a real-life problem is called modeling. Below is an
example of how we can use graphs to model a problem.

35. Euler Circuits
The only thing that truly matters to the solution of this
problem is the relationship between land masses (islands
and banks) and bridges. Which land masses are connected
to each other and by how many bridges?

36. Euler Circuits
This information is captured by the red edges in (b). We
end up with the graph model shown in (c). The four vertices
of the graph represent each of the four land masses; the edges
represent the seven bridges.

37. Euler Circuits
5.5 Euler’s Theorems

38. Euler Circuits Euler’s Circuit Theorem
If a graph is connected, and every vertex is even, then it has an Euler circuit (at least one, usually more).
If a graph has any odd vertices, then it does not have an Euler circuit.

39. Euler Circuits
The graph in (a ) cannot have an Euler circuit because it is disconnected. The graph in (b) has odd vertices (C is one of them, there are others). The graph in (c) is connected and all the vertices are even. The graph does have Euler circuits.

40. Euler Circuits Euler’s Path Theorem
If a graph is connected, and has exactly two odd vertices, then it has an Euler path (at least one, usually more). Any such path must start at one of the odd vertices and end at the other one.
If a graph has more than two odd vertices, then it cannot have an Euler path.

41. Euler Circuits Euler’s Sum of Degrees Theorem
The sum of the degrees of all the vertices of a graph equals twice the number of edges (and therefore is an even number).
A graph always has an even number of odd vertices.

42. Euler Circuits
5.6 Fleury’s Algorithm

43. Euler Circuits Fleury’s Algorithm for Finding an Euler Circuit (Path)
Preliminaries. Make sure that the graph is connected and either (1) has no odd vertices (circuit), or (2) has two odd vertices (path).

44. Euler Circuits Fleury’s Algorithm for Finding an Euler Circuit (Path)
Start. Choose a starting vertex. [ In case (1) this can be any vertex; in case (2) it must be one of the two odd vertices.]

45. Euler Circuits Fleury’s Algorithm for Finding an Euler Circuit (Path)
Intermediate steps. At each step, if you have a choice, don’t choose a bridge of the yet-to-be-traveled part of the graph. However, if you have only one choice, take it.

46. Euler Circuits Fleury’s Algorithm for Finding an Euler Circuit (Path)
Intermediate steps. At each step, if you have a choice, don’t choose a bridge of the yet-to-be-traveled part of the graph. However, if you have only one choice, take it.

47. Euler Circuits Fleury’s Algorithm for Finding an Euler Circuit (Path)
End. When you can’t travel any more, the circuit (path) is complete. [In case (1) you will be back at the starting vertex; in case (2) you will end at the other odd vertex.]

48. Identify Euler Path or Circuit

49. Example #1

50. Euler Circuits
5.7 Eulerizing Graphs

51. Eulerizing Graphs
Process of adding edges in order to make the graph an Euler Circuit.

52. Eulerizing Graphs Step 1: Identify the odd vertices.
This graph has eight odd vertices (B,C,E,F,H,I,K,and L), shown in red.

53. Eulerizing Graphs Step 2:
Add the minimum amount of duplicate edges to adjacent vertices, to make each vertex even.

54. Eulerizing Graphs Note: Duplicate edges are not really “new” edges!
They are where we will retrace an edge
These edges are called Deadhead Edges.

55. Eulerizing Graphs
With the four duplicate edges (BC,EF,HI,and KL) indicating the deadhead blocks where a second pass is required. The total length of this route is 28 blocks (24 blocks in the grid plus 4 deadhead blocks).

56. Semi- Eulerizing Graphs
Process of adding edges in order to make the graph an Euler Path.

57. Semi-Euleriztion Step 1:
Identify the all odd vertices. Choose two that will remain unchanged (starting & ending points)

58. Semi-Euleriztion Step 2:
Change the other odd vertices into even vertices by adding the least amount of edges.

59. Example #2
Create a graph that models the map below. The Chamber of Commerce wants to come up with a walking tour of the city that crosses all the bridges, yet minimizes duplicate routes. Your job is to create two different options. One, in which the tourists would start and end at the same location and another that starts and ends in different locations.

60. Example # 2