Computer Science · Graph Theory
'n' शीर्षों (vertices) वाले एक सम्बद्ध ग्राफ (connected graph) के स्पैनिंग ट्री (spanning tree) में कोर (edges) की संख्या कितनी होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1n(n - 1)2
- 2n + 1
- 3n - 1✓
- 4n
सही उत्तर देखें
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
Preparing for Computer Science?
Practice full-length Computer Science 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