A(n) ____ tree T is a simple graph such that if u and v are two vertices in T, a unique path exists from u to v.
A) rooted
B) free
C) spanning
D) weighted

Question

Quizplus · Accepted Answer

A free or unrooted tree is a simple graph in which any two vertices are connected by exactly one path. It is also called a "spanning tree" if it contains all the vertices of the graph. A weighted or rooted tree is a tree where each edge has been assigned a weight or cost, and a unique path exists between any two vertices. Therefore, option B is the correct answer.

A(n) ____ Tree T Is a Simple Graph Such That