Slides in this set
Which of these can be drawn without taking your pencil off
the paper and without going over the same line twice?
If we introduce a vertex where two lines meet and make the
lines edges, then we can model these problems as graphs.
If we can find a path that goes over all the edges of the graph without
repeating an edge then the graph is said to be traversable.…read more
Whether or not a graph is traversable depends on the number
of edges that meet at the vertices. The number of edges that
meet at a vertex is called the degree of that vertex.
An odd vertex is one with an odd degree.
An even vertex is one with an even degree.…read more
A graph with exactly 2 odd vertices is traversable as long as we
start on one of the odd vertices and finish at the other one. Such a
graph is called Semi-Eulerian.
2 odd vertices All vertices even
Semi-Eulerian Eulerian graph.…read more
Which type of graph is the one on the far right?
4 odd vertices
2 odd vertices All vertices even Two odd vertices
Semi-Eulerian Eulerian graph. - Semi-Eulerian…read more