Question:

A graph has $ n $ vertices and $ e $ edges. What is the number of vertices in the spanning tree of that graph?

Show Hint

In a spanning tree, the number of vertices is the same as in the original graph.
Updated On: May 3, 2025
  • \( |n - e| \)
  • \( |n - e + 1| \)
  • \( n \)
  • \( e \)
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

A spanning tree of a graph with \( n \) vertices always has exactly \( n \) vertices. This is because a spanning tree is a subgraph that includes all the vertices of the original graph but without cycles and with the minimal number of edges.
Thus, the number of vertices in the spanning tree is \( n \).
Was this answer helpful?
0
0