Mathematics · Graph Theory
In a connected graph with n vertices, the number of edges in its spanning tree is:
- 1exactly n
- 2always (n − 1)✓
- 3less than or equal to (n − 2)
- 4at least n
Correct answer
always (n − 1)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Graph Theory