Scribd
Upload
65 views21 pages

Leonhard Euler: Eulerian Path & Circuit Network Puzzle

1) The document discusses Eulerian paths and circuits in graphs and networks. Specifically, it examines the problem of the Seven Bridges of Königsberg and whether a path crossing each bridge once is possible. 2) An Eulerian path visits every edge exactly once but may start and end at different vertices, while an Euler circuit both starts and ends at the same vertex. 3) For a graph to have an Euler path, it requires two vertices of odd degree and all others even, while an Euler circuit requires all vertices to have even degree. Applying this to Königsberg's network shows it does not have an Euler path due to four vertices of odd degree.

Uploaded by

Wulan Darma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
65 views21 pages

Leonhard Euler: Eulerian Path & Circuit Network Puzzle

1) The document discusses Eulerian paths and circuits in graphs and networks. Specifically, it examines the problem of the Seven Bridges of Königsberg and whether a path crossing each bridge once is possible. 2) An Eulerian path visits every edge exactly once but may start and end at different vertices, while an Euler circuit both starts and ends at the same vertex. 3) For a graph to have an Euler path, it requires two vertices of odd degree and all others even, while an Euler circuit requires all vertices to have even degree. Applying this to Königsberg's network shows it does not have an Euler path due to four vertices of odd degree.

Uploaded by

Wulan Darma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

EULERIAN PATH & CIRCUIT

NETWORK PUZZLE

Leonhard Euler
The Seven Bridges of Königsberg
• Can you take a walk through the town, visiting each 
part of the town and crossing each bridge only
once?
“Is it possible to draw a given picture without lifting pencil from 
the paper and without tracing any of the edges more than once?”
You should:
Draw all the lines, but never go over any line 
more than once, and don't remove your pencil 
from the paper.
Can you draw this?
Or something like this?
Can you draw this?
EULERIAN PATH
 Eulerian path (or Eulerian trail) is a path in a 
graph that visits every edge exactly once
EULERIAN CIRCUIT
 Eulerian Circuit is an Eulerian Path which starts 
and ends on the same vertex.
So, How Can We Know Which Ones Work and Which Ones Do Not?
Do you notice a 
pattern?
IT IS AN EULER PATH …
• If two vertices have odd degree and all other 
vertices have even degree. 
IT IS AN EULER CIRCUIT …
• If all vertices have even degree.
Now Back to the Königsberg Bridge Question

Vertices A, B and D have 
degree 3 and vertex C has 
degree 5, so this graph has 
four vertices of odd degree. 
So it does not have an Euler
Path.

You might also like