When is a network transferable?
The Königsberg bridge problem was an old puzzle concerning the possibility of finding a path over every one of seven bridges that span a forked river flowing past an island—but without crossing any bridge twice. Euler argued that no such path exists.
Euler was a prolific mathematician whose work spanned the fields of geometry, calculus, trigonometry, algebra, number theory, physics, lunar theory, and even astronomy. Euler's contemporary colleagues, and even mathematicians working today, recognize him as one of the greatest mathematicians to have ever lived.
What is a node? A node (or vertex) of a network is one of the objects that are connected together. The connections between the nodes are called edges or links. A network with 10 nodes (or vertices) and 11 edges (or links).
What is a network? A network is simply a collection of connected objects. We 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.
The rules are:
- All nodes are even and you can start and finish anywhere
- Two nodes can be odd but you have to start at one odd one and finish at the other odd node.
- If all nodes are odd then it will not work.
An example of this is the house version.
When each node is,
A-3
B-4
C-2
D-4
E-3
Since it only has two odd nodes it is transferable.
Do you know any other examples?
