1. A spanning tree is a tree that contains:

a. at least three vertices

b. at least one cycle

c. all the vertices of the graph

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

  

Return to Homepage | Question #4