Mathematics · Graph Theory
Arrange the following simple graphs based on the number of spanning trees they have (in ascending order): A. K2 [Complete graph with 2 nodes] B. C4 [Cycle graph with 4 nodes] C. K2,3 [Complete bipartite graph] D. K5 [Complete graph with 5 nodes]
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A, B, C, D✓
- 2A, C, B, D
- 3B, A, C, D
- 4C, B, A, D
Correct answer
A, B, C, D
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