A tree T is called a(n) ____ tree of graph G if T is a subgraph of G such that V(T) = V(G); that is, if all vertices of G are in T.
A) weighted
B) spanning
C) rooted
D) directed

Question

Quizplus · Accepted Answer

A spanning tree includes all the vertices of the graph G while minimizing the number of edges. Therefore, it satisfies the condition described in the question. The other options (weighted, rooted, and directed) imply additional characteristics of the tree that are not necessary for it to be a subgraph of G with all vertices included.

A Tree T Is Called A(n) ____ Tree of Graph