Traversable Network

Who was Leonhard Euler?

Leonhard Euler was born in Basel, Switzerland in the year of 1707. He was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who made important and influential discoveries in many branches of mathematics, such as infinitesimal calculus and graph theory, while also making pioneering contributions to several branches such as topology and analytic number theory. He also made the modern mathematical terminology and notation. 

link: https://en.wikipedia.org/wiki/Leonhard_Euler

What was his theory about the Konigsberg Bridge? Where is Konigsberg?

Konigsberg Bridge is a recreational mathematical puzzle and it is located in the city of Russia called Kaliningrad city. that led to the development of the branches of mathematics known as topology and graph theory. In the early 18th century, the citizens of Königsberg spent their days walking on the intricate arrangement of bridges across the waters of the Pregel (Pregolya) River, which surrounded two central landmasses connected by a bridge.

link:  https://www.britannica.com/science/Konigsberg-bridge-problem

What is a network?                                

A network is a simply a collection of connected objects. It is refer to the objects as nodes or vertices, and usually draw them as points. We refer to the connections between the nodes as edges, and usually draw them as lines between points.

How do you know if a network is transferable?

There will be a nodes that is placed to where two or more lines meet. On these networks, the nodes are clearly shown by the black points in the diagrams. Now you are probably wondering what this has to do with the network being traversable or not. The node either would have an odd or even number of lines connected to it. Do not count the nodes with an even number of lines connected to it. Count the number of nodes with an odd number of lines connected to it. If there are no odd nodes or if there are two odd nodes, that means that the network traversable. Networks with only two odd nodes are in a traversable path and networks with no odd nodes are in a traversable circuit." 

link: https://nrich.maths.org/2326/solution#:~:text=Count%20the%20number%20of%20nodes,are%20in%20a%20traversable%20circuit.%22