Computer Science · Graph Theory
For a connected weighted graph G with 6 vertices and 14 edges, the cost of its minimum spanning tree is 32. What is the minimum spanning tree cost if the cost of every edge in G is doubled?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 164✓
- 242
- 346
- 443
Correct answer
64
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