1. A spanning tree is a tree that contains:

d. all odd vertices of the graph, but not even vertices

Nope, see pages 504 - 505 of the Student Module Text. Also see Session 20; Page 4; Picture C.

Return to Homepage | Question #4