Eulerian Paths and Circuits
In order for a graph to have an Eulerian circuit, it will certainly have to be connected.
Suppose we have a connected graph G = (V, E), The following statements are equivalent:
- All vertices in G have even degree.
- G consists of the edges from a disjoint union of some cycles, and the vertices from these cycles.
- G has an Eulerian circuit.
- 1 → 2 can be shown by induction on the number of cycles.
- 2 → 3 can also be shown by induction on the number of cycles, and
- 3 → 1 should be immediate.
An Eulerian path (a walk which is not closed but uses all edges of G just once) exists if and only if G is connected and exactly two vertices have odd valence.
Read more about this topic: Route Inspection Problem
Famous quotes containing the words paths and/or circuits:
“She had no longer any relish for her once favorite amusement of reading. And mostly she disliked those authors who have penetrated deeply into the intricate paths of vanity in the human mind, for in them her own folly was continually brought to her remembrance and presented to her view.”
—Sarah Fielding (1710–1768)
“The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital computer or the gears of a cycle transmission as he does at the top of a mountain or in the petals of a flower.”
—Robert M. Pirsig (b. 1928)