GPH Theory: Your Ultimate Guide to General Topics, News, SEO, and Technology

Welcome to GPH Theory, your go-to source for the latest news, insights, and analysis on general topics, SEO, technology, and more. Our mission is to provide you with the most relevant and up-to-date information to help you stay ahead of the curve. From beginners to experts, we have something for everyone. Join us and start your journey towards digital excellence today.

KONIGSBERG BRIDGE PROBLEM IN GRAPH THEORY

  Bittu      

The Konigsberg bridge problem

 Is the perhaps the best known example in graph theory. It was a long-standing problem until solved by  Leonhard Euler(1907-1983) in 1736, by means of a graph.
Two islands, C and D, formed by the Pergel River in Konigsberg were connected to each other and to the banks A and B with seven bridges. The problem was to start at any of the four land areas of the city A, B, C, or D, walk over each of the seven bridges exactly ones, and return to the starting point.

Tour Package,plan your tour well with us visit for effective and economical tour packages

Euler represented this situation by means of a graph. The vertices represent the land areas and the edges represent the bridges. Euler proved that a solution for this problem does not exist.


logoblog

Thanks for reading KONIGSBERG BRIDGE PROBLEM IN GRAPH THEORY

Previous
« Prev Post

1 comment:

  1. hey buddy ur concept help me a lot to understand graph of konigs....thanks

    ReplyDelete