Scribd
Upload
9 views6 pages

Unit 2-I (The Konigsberg Bridge Problem)

The document discusses the historical problem of the Königsberg Bridges, which involves determining whether it's possible to traverse all bridges in the city without crossing any bridge more than once. Swiss mathematician Leonhard Euler proved in 1736 that such a tour is impossible if there are more than two vertices with an odd number of connections. The document also differentiates between Euler paths and Hamilton paths, highlighting their significance in various applications like traffic planning and network design.

Uploaded by

meenakrishu123
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
9 views6 pages

Unit 2-I (The Konigsberg Bridge Problem)

The document discusses the historical problem of the Königsberg Bridges, which involves determining whether it's possible to traverse all bridges in the city without crossing any bridge more than once. Swiss mathematician Leonhard Euler proved in 1736 that such a tour is impossible if there are more than two vertices with an odd number of connections. The document also differentiates between Euler paths and Hamilton paths, highlighting their significance in various applications like traffic planning and network design.

Uploaded by

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

You might also like