Computer Science · Graph Theory
Consider an undirected weighted complete graph G with 3 vertices, whose adjacency matrix G has 0 on the main diagonal and 2 on all off-diagonal entries. Which of the following is true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Graph G has 3 spanning trees of different costs
- 2Graph G has 3 distinct minimum spanning trees, each of cost 4✓
- 3Graph G has a unique minimum spanning tree of cost 4
- 4Graph G has no minimum spanning tree
Correct answer
Graph G has 3 distinct minimum spanning trees, each of cost 4
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