Mathematics · Graph Theory
How many distinct spanning trees does a complete graph K5 with 5 vertices have?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1325
- 2225
- 3125✓
- 425
Correct answer
125
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 Mathematics?
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 Mathematics · Graph Theory