Chapter 7

1) Determine if the following descriptions will (1) ALWAYS, (2) NEVER, or (3) SOMETIMES be a tree. If the graph is sometimes a tree, then make sure to provide an example of the graph as a tree and another not as a tree. a. 5 vertices and exactly one path from any vertex to any other vertex. b. 27 edges and 26 vertices. c. 5 vertices and 4 edges. ................
................