ABSTRACT
A graph with no closed paths cannot have multiple edges or loops, so it must be a simple graph. Throughout this chapter we will use “graph” to mean “simple graph.” Figure 10.1 gives some examples of trees, some of which are making repeat appearances, as they have already shown up in Chapter 9.
