A __________ tree is a tree that includes all of the vertices of a graph and some, but possibly not all, of the edges.
A) Directed
B) Undirected
C) Spanning
D) None of the above

Question

Quizplus · Accepted Answer

A spanning tree is defined as a subset of Graph G, which has all the vertices covered with the minimum possible number of edges. Hence, it includes all vertices of the graph and some (or possibly all) of the edges, making it a minimal connected subgraph.

A __________ Tree Is a Tree That Includes All of the Vertices