1. Simple Graph Warmup

2. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct, v 0 =v n, and {v i,v i+1 } is an edge for 0≤i<n. The length of the cycle is n. Fact: There can be no cycles of length 0, 1, or 2. (Why?)

3. Trees A tree is a connected acyclic graph. (These are a kind of undirected graph, so the definition is different from the directed trees we talked about earlier.)

4. In a tree there is a unique path between any pair of vertices Proof. If there were two vertices with no path between them, the graph would not be connected. Suppose there were two vertices with two distinct paths between them. By the WOP there would be a shortest possible path in the graph for which there is a distinct path between the same pair of endpoints. The second path must have no vertices in common with the first except the endpoints (otherwise first path would not be the shortest). Then following one path forward and the other back creates a cycle, contradiction. So there cannot be more or less than one path between any pair of vertices. QED.

5. Finis