Mathematics · Graph Theory
Consider graph M with three vertices having adjacency matrix: M = [ 0 1 1 ] [ 1 0 1 ] [ 1 1 0 ] Which of the following is true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Graph M has no minimum spanning tree.
- 2Graph M has a unique minimum spanning tree of cost 2.
- 3Graph M has 3 distinct minimum spanning trees, each of cost 2.✓
- 4Graph M has 3 spanning trees of different costs.
Correct answer
Graph M has 3 distinct minimum spanning trees, each of cost 2.
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