Computer Science · Graph Theory
How many edges does a spanning tree of a connected graph with N vertices have?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1N + 1
- 2N(N - 1)/2
- 3N - 1✓
- 4N
Correct answer
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory