Clair 1 the seven bridges of k onigsberg problem k onigsberg is an ancient city of prussia, now kalingrad, russia. The seven bridges of konigsberg is a historically notable problem in mathematics. The seven bridges of konigsberg problem was solved by euler in 1735 and that was the beginning of graph theory. The seven bridges of konigsberg problem, proved impossible in 1741, was the origin of graph theory. Diagramming using nodes and edges is a helpful method to solve problems like these. Euler and graph theory this longstanding problem was solved in 1735 in an ingenious way by the swiss mathematician leonhard euler 17071782. The seven bridges of k onigsberg i in 1735, the city of k onigsberg presentday kaliningrad was divided into four districts by the pregel river. The module is taught to fourth year undergraduate students at gmit.
Now the problem of touring a city while crossing every bridge exactly once has become a problem of drawing a graph with one continuous stroke while tracing every edge exactly once. There are many other problems which may be treated by graph theory. Konigsberg bridge problem in graph theory gate vidyalay. That is, he first made a mathematical model of the problem. Euler circuits and the konigsberg bridge problem math user. Konigsberg was a city in prussia that was separated by the pregel river. He addresses both this specific problem, as well as a general solution with any number of landmasses and any number of bridges. Konigsberg bridge problem in graph theory it states is it possible to cross each of the seven bridges exactly once and come back to the starting point without swimming across the river. Yet from such deceptively frivolous origins, graph theory has grown into a powerful and deep mathematical theory with applications in the physical, biological, and social sciences. The points p, q, r and s are called vertices, the lines are called edges or arcs and the whole diagram is called a graph. Teo paoletti, leonard eulers solution to the konigsberg bridge problem eulers proof and graph theory, convergence may 2011. Introduction graph theory was born in 1736 when euler, the father of graph theory solved konigsberg bridge problem.
Bridges of konigsberg investigation teaching resources. Eulers result marked the beginning of graph theory, the study of networks made of dots connected by lines. Graph theory origin and seven bridges of konigsberg rhishikesh. To most of us mathematics is a science dealing with the measurement of quantities. The problem sheet is written in latex, and a tex distribution is required to compile it. One of these is the tourist problem n cities are connected by m roads and one asks the question is it possible to visit all the cities using all the roads but never moving along on the same road twice. Its negative resolution by leonhard euler in 1736 laid the foundations of graph theory and prefigured the idea of topology the city of konigsberg in prussia now kaliningrad, russia was set on both sides of the pregel river, and included two large islandskneiphof and lomsewhich were connected to each. This problem was solved by famous mathematician leonhard euler in 1735. Euler circuits and the konigsberg bridge problem, professor janet heine barnett eulerian path and circuit for undirected graph, geeksforgeeks the seven bridges of. In terms of graph theory, two of the nodes now have degree 2, and the other two have degree 3. An introduction to networks and the konigsberg bridge problem. Euler spent much of his working life at the berlin academy in germany, and it was during that time that he was given the the seven bridges. Tes global ltd is registered in england company no 02017289 with its registered office at 26 red lion square london. The areas a, b, c and d are bits of land, joined by the bridges, but otherwise cut off.
Graph theoretical ideas are highly utilized by the applications in computer sci ences 10. The field of graph theory started its journey from the problem of konigsberg bridge in 1735 3. Another interesting problem in graph theory is the traveling salesman problem. Konigsberg is an ancient city of prussia, now kalingrad, russia. The river divided the city into four separate landmasses, including the island of kneiphopf. This is a problem sheet for the module graph theory. He denoted the four pieces of lands with nodes in a graph. The structure and function of complex networks pdf. Leonhard euler 1707 1783, a swiss mathematician, was one of the greatest and most prolific mathematicians of all time. Graph theory frank harary an effort has been made to present the various topics in the theory of graphs in a logical order, to indicate the historical background, and to clarify the exposition by including.
Pdf graph routing problem using eulers theorem and its. The city was set on both sides of the pregel river, which also had two islands connected to. Simple examples of applications of this theory, including the famous problems of the bridges. Once you have represented the problem in this way, its features are much easier to see. Graph theory problems berkeley math circles 2015 lecture notes graph theory problems instructor.
Leonard eulers solution to the konigsberg bridge problem. A simple idea of drawing crude sketches made of line segments to visualize the solutions of some problems has developed over the years into a sophisticated branch of mathematics. Is it possible for a pedestrian to walk across all seven bridges in konigsberg. Eulers solution for konigsberg bridge problem is considered as the first theorem of graph theory which gives the idea of eulerian circuit. The four districts were connected by seven bridges. Bearing this in mind, you can turn the messy map of the town into a neat network also called a graph, with dots representing land masses and links between them the bridges. This problem lead to the foundation of graph theory. Graph theory problems 1 the seven bridges of konigsberg problem. Like other early graph theory work, the konigsberg bridge problem has the appearance of being little more than an interesting puzzle. So let 0 and 1 be the mainland and 2 be the larger island with 5 bridges.
We are going to use graph theory in order to prove that the konigsberg bridge problem. In 1735, leonhard euler took interest in the problem. Graph theory 2 abstract the seven bridges of konigsberg problem, proved impossible in 1741, was the origin of graph theory. In the early 18th century, the citizens of konigsberg spent their days walking on the intricate arrangement of bridges across the waters of the pregel pregolya. The konigsberg bridge problem was one of the first problems in this. The seven bridges of konigsberg the problem goes back to year 1736.
Konigsberg bridge problem, a recreational mathematical puzzle, set in the old prussian city of konigsberg now kaliningrad, russia, that led to the development of the branches of mathematics known as topology and graph theory. The only thing that is important is how things are connected. This socalled geometry of position is what is now called graph theory, which euler introduces and utilizes while solving this famous problem. Graph theory and the konigsberg bridge problem david pleachers. The answer follows from eulers koenigsberg bridge problem. Some other graph theory problems have gone unsolved for centuries scienceweek, 2. Euler spent much of his working life at the berlin academy in germany, and it was during that time that he was given the the seven bridges of konigsberg question to solve that has become famous. P u zzles like the seven bridges of konigsberg interested him and were part of a new branch of mathematics that he started called topology. Pdf the koenigsberg bridge problem and elementary graph.
In 1847 kirchhoff developed the theory of trees in order to solve the. Alexanderson graph theory almost certainly began when, in 1735, leonhard euler solved a popular puzzle about bridges. Salem college is an independent college committed to the liberal arts and quality professional preparation. In konigsberg, a river ran through the city such that in its center was an island, and after passing the island. Graph theory has been extended to the application of color mapping.
Graph theory can be defined as the study of graphs graphs are mathematical structures used to model pairwise relations between objects from a certain. Konigsberg bridge problem solution was provided by leon hard euler concluding that such a walk is impossible. The people of konigsberg were unable to find a path as well. The city was set on both sides of the pregel river, which also had two islands connected to each other with seven bridges. Paths to travel each nodes using each edge seven bridges. Here is a map of konigsberg, prussia, which is now called kaliningrad, russia.
Yet from such deceptively frivolous origins, graph theory has grown into a powerful and deep mathematical theory. Founded by the moravian church in 1772 as a school for girls, salem strives to set its. In konigsberg, a river ran through the city such that in its center was an. His solution, and his generalization of the problem to an arbitrary number of islands and bridges, gave rise to a very important branch of mathematics called graph theory. Graph theory is a branch of mathematics that studies networks of points connected by lines. In konigsberg, a river ran through the city such that in its center was an island, and after passing the island, the river broke into two parts. Leonard eulers solution to the konigsberg bridge problem the fate of konigsberg.
This paper, called solutio problematis ad geometriam situs pertinentis, was later published in 1741 hopkins, 2. Part16 practice problem on euler graph in hindi euler graph example proof euler circuit path duration. This website and its content is subject to our terms and conditions. The problem of finding a path that crosses every bridge exactly once now turns into finding a path through the graph. Now apply what you have learned to the konigsberg bridge problem that leonard euler solved.
176 1480 510 73 1032 45 76 698 145 1487 1444 529 768 1101 161 1207 389 500 1400 443 249 1001 1063 1324 456 731 133 1087 217 1283 923 1179 1122 51 980 469 570 858 900 167 280 688 412 419 1145 106