Solved

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

Question 18

Multiple Choice

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

Related Questions

Q13: _ algorithm builds the tree iteratively by

Q14: A binary tree has no cycles.

Q15: In a(n) _ graph, the tail of

Q16: It is possible to design Prim's algorithm

Q17: An edge incident on a single vertex

Q19: The depth first traversal is similar to

Q20: Y is a(n) _ of X if

Q21: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering

Q22: A graph G is a pair, G

Q23: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering