Computer Science · Graph Theory
Consider a connected undirected graph G with distinct edge weights. Let CD be the edge with the minimum weight and AB be the edge with the maximum weight in G. Which of the following statements is FALSE?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1G has a unique minimum spanning tree.
- 2No minimum spanning tree can contain AB.✓
- 3If AB is in a minimum spanning tree, then its removal must disconnect G.
- 4Every minimum spanning tree of G must contain CD.
Correct answer
No minimum spanning tree can contain AB.
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