Scribd
Upload
99 views

Euler Graph PDF

The document discusses Euler and topology, specifically the Konigsberg bridge problem. It introduces the problem of finding a route crossing each bridge exactly once in Konigsberg. Euler represented the land masses as vertices and bridges as edges, reducing it to a network problem. His graph theorems state that a connected graph has an Eulerian circuit if every vertex is even degree, and has an Eulerian path if it has exactly two odd degree vertices. The document provides examples of graphs that must or must not have Eulerian cycles or paths based on the number of odd degree vertices.

Uploaded by

Mariane Diane Maputi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
99 views

Euler Graph PDF

The document discusses Euler and topology, specifically the Konigsberg bridge problem. It introduces the problem of finding a route crossing each bridge exactly once in Konigsberg. Euler represented the land masses as vertices and bridges as edges, reducing it to a network problem. His graph theorems state that a connected graph has an Eulerian circuit if every vertex is even degree, and has an Eulerian path if it has exactly two odd degree vertices. The document provides examples of graphs that must or must not have Eulerian cycles or paths based on the number of odd degree vertices.

Uploaded by

Mariane Diane Maputi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Worksheet 29: Monday April 20

Euler and Topology


The Konigsberg Problem: The Foundation of Topology
The Konigsberg Bridge Problem is a very famous problem solved by Euler in 1735.
Below is a picture of the bridges connecting the land masses in Konigsberg (now Kaliningrad).

Here is the question: Is there a route we can take that crosses each bridge exactly once?

First, represent the land masses as vertices, and the bridges as edges so that we can reduce the
problem to a network problem.

The question now becomes: Is there a path that follows each edge only once?

If we need to go in and out of each vertex (except for when we begin and end), can you deduce
something about the number of edges that these vertices must have?

Have a look at your graph. Is it possible to travel through Konigsberg, crossing each bridge
exactly once?
Math 105 Spring 2015 Worksheet 29 Math As A Liberal Art

Definition Eulerian Path: A connected graph in which one can visit every edge exactly once
is said to possess an Eulerian path or Eulerian trail.

Definition Eulerian Circuit: An Eulerian circuit is an Eulerian trail where one starts and
ends at the same vertex.

Euler’s Graph Theorems


Theorem 1: Euler circuits
A connected graph in the plane must have an Eulerian circuit if every vertex in the graph is of
even degree (i.e. has an even number of edges coming out of it). If a graph has any vertices of
odd degree then it can not have an Eulerian circuit.
Theorem 2: Euler paths
If a connected graph has more than 2 vertices of odd degree then it can not have an Eulerian
path. If a connected graph has exactly 2 vertices of odd degree then it has at least one Eulerian
path.
Theorem 3: Degrees of Graphs
The sum of the degrees of the vertices of a graph is an even number (twice the number of edges).
The number of vertices of odd degree in a graph is always even.

Summarizing Euler’s Graph Theorems


The number of vertices of odd degree determines what you can conclude
Number of Vertices With Odd Degree Implication from Euler’s Theorems
0 There is atleast one Eulerian circuit
2 There is at least one Euler path
(and no Euler circuit)
2k (where k > 1) There are no Euler circuits or Euler paths.

EXAMPLE
Let’s demonstrate each of the three implications from the table with appropriate graphs.

2
Math 105 Spring 2015 Worksheet 29 Math As A Liberal Art
GroupWork
Determine which (if any) of the following graphs must have atleast one Eulerian cycle.

Determine which (if any) of the following graphs must have atleast one Eulerian path.

Determine which (if any) of the following graphs must NOT have an Eulerian cyle or Eulerian
path.

A B C

D E F

3
Math 105 Spring 2015 Worksheet 29 Math As A Liberal Art

Exercise
For fun you can confirm the Eulerian characteristic V-E+F=1 for each of the given connected
graphs in the plane.

For fun you can confirm Euler’s Degree Theorem for each of the given connected graphs in the
plane. (The sum of degrees of all the vertices in each graph equals twice the number of edges.)

You might also like