Top Banner
BRIDGE PROBLEM By:- Mitul K. Desai - 23
12

Bridge problem : Discrete Structure

Jun 20, 2015

Download

Education

Mitul Desai

This presentation briefs you with the bridge problem of Discrete Structure and solution to solve it using euler's theorem
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Bridge problem : Discrete Structure

BRIDGE PROBLEM

By:-

Mitul K. Desai - 23

Page 2: Bridge problem : Discrete Structure

WHAT IS IT ?• In the early eighteenth century, the mediaeval town of

Königsberg in Prussia had a central island (the Kneiphof) around which the Pregel river flowed before dividing in two.

• The four parts of the town were linked by seven bridges as shown on the diagram.

Page 3: Bridge problem : Discrete Structure

7 bridges of Koenigsberg (1736)

Page 4: Bridge problem : Discrete Structure

HISTORY• The official birth of graph theory goes

back precisely to the year 1736, when mathematician Leonard Euler (1707-1783) was asked the following question at the court of the king of Prussia:

Page 5: Bridge problem : Discrete Structure

QUESTION ?• Is it possible for a person to take a walk around town,

starting and ending at the same location, and crossing each of the seven bridges exactly once ?

Page 6: Bridge problem : Discrete Structure

SOLUTION• Euler studied this problem using the multigraph obtained

where:

• the four regions are represented by vertices.

• the bridges by edges.

Page 7: Bridge problem : Discrete Structure
Page 8: Bridge problem : Discrete Structure

DEFINATION• An Euler circuit in a graph G is a simple circuit containing

every edge of G. An Euler path in G is a simple path containing every edge of G.

• Path: a path from v to w is a walk from v to w that does not have any repeated edges.

• Circuit: a circuit is a closed walk, with no repeated edges.

Page 9: Bridge problem : Discrete Structure

Euler’s Theorem 1

• If a graph has any odd vertices, then it cannot have an Euler circuit.

• If a graph is connected and every vertex is even, then it has at least one Euler circuit.

Page 10: Bridge problem : Discrete Structure

CONCLUSION

• What we can show is that every vertex must have even degree.

• First note that an Euler circuit begins with a vertex a and continues with an edge incident with a, say {a, b}.

• The edge {a, b} contributes one to degree(a).

Page 11: Bridge problem : Discrete Structure

CONCLUSION• Each time the circuit passes through a vertex it contributes two

to the vertex’s degree, because the circuit enters via an edge incident with this vertex and leaves via another such edge.

• Finally, the circuit terminates where it started, contributing one to degree(a).

• Therefore, degree(a) must be even, because the circuit contributes one when it begins, one when it ends, and two every time it passes through a

Page 12: Bridge problem : Discrete Structure

Thank You