Network Tutorial
Eurler came up with the following
theorms to describe traversable graphs:
Euler stated the rules in
two theorems:
Euler's Theorem 1
If a graph has any verticies
of odd degree, then it cannot have an Euler Circuit.
and
If a graph has all even verticies,
then it has at least one Euler Circuit - usually more.
Euler's Theorem 2
If a graph has more than 2
verticies of odd degree, then if cannot have an Euler Path.
and
If a graph is connected and has
exactley 2 verticies of odd degree, then it has at least one Euler path.
This path must start at one of the odd-degree vertecies and end at the
other.
Graphs/networks
Degree of Vertex Even
/ Odd Vertex Traversable
Euler Circuit Euler
Path