Question:

How many edges will a tree with $ n $ vertices have?

Show Hint

Remember that in any tree, the number of edges is always one less than the number of vertices.
Updated On: May 3, 2025
  • \( \left\lfloor \frac{n}{2} \right\rfloor \)
  • \( n \)
  • \( 2 \times n \)
  • \( n - 1 \)
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

A tree is a connected acyclic graph. It is a fundamental property of trees that a tree with \( n \) vertices always has \( n - 1 \) edges. This is because, in a tree, there are no cycles, and adding any extra edge would create a cycle.
Thus, the number of edges in a tree with \( n \) vertices is \( n - 1 \).
Was this answer helpful?
0
0