A tree with n-1 edge has how many vertices?
Answers
Answered by
1
Answer:
The graph shown here is a tree because it has no cycles and it is connected. It has four vertices and three edges, i.e., for 'n' vertices 'n-1' edges as mentioned in the definition. Note − Every tree has at least two vertices of degree one.
Similar questions