Chapter 2 Trees and Connectivity

2.1

Definitions and Simple Properties A graph G is called acyclic if it contains no cycles.

Since loops are cycles of length one while a pair of parallel edges produces a cycle of length two, any acyclic graph must be simple. A graph G is called a tree if it is a connected acyclic graph. Figure 2.1 shows all trees with at most five vertices. o 1 vertex 2 vertices 6 3 vertices 4 vertices

5 vertices

Figure 2.1: Tks trees with at most five vwticci. Figure 2.2 shows ail trees with six vertices while Figure 2.3 shows two more luxuriant trees. 47

T+