Question

40) A tree with n vertices has 2 points
edges.
O a)1-n
Ob) n-1
O c) n
O d) n+1​

Answer 1

Answer:

When the first root vertex has been added, the number of edges is zero. After the root vertex, every vertex that is added to the construction of T contributes one edge to T.

Adding the remaining n−1 vertices to the construction of T, after the root vertex, will add n−1 edges.

Therefore, after the reconstruction of T is complete, T will have n vertices and n−1 edges.

Hence Proved.