Multiple Choice
A tree in which a particular vertex is designated as a root is called a(n) ____ tree.
A) spanning
B) weighted
C) free
D) rooted
Correct Answer:
Verified
Related Questions
Q33: Let G be an undirected graph.Let u
Q34: A maximal subset of connected vertices is
Q35: A minimal spanning tree of G is
Q36: A set Y is called a(n) _
Q37: In a(n) _ graph, the tail of
Q39: The shortest path is the path with
Q40: In Prim's algorithm for the minimal spanning
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents