Consider a graph , where , and weight of the edge is . The weight of minimum spanning tree of is ________.
GATE CS 2020 (Forenoon) — Question 59
AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Minimum Spanning Trees (Prim/Kruskal Algorithms)
- GATE CS 2026 (Forenoon) · Q49Let G(V, E) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum span…
- GATE CS 2025 (Forenoon) · Q18Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G . For any two vertices, u and v , let d 1(u…
- GATE CS 2025 (Forenoon) · Q64The maximum value of x such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is . (Ans…
- GATE CS 2025 (Afternoon) · Q37Let G be an edge-weighted undirected graph with positive edge weights. Suppose a positive constant is added to the weight of every edge. Wh…
- GATE CS 2024 (Afternoon) · Q59The number of distinct minimum-weight spanning trees of the following graph is .
- GATE CS 2022 (Forenoon) · Q49Consider a simple undirected weighted graph G, all of whose edge weights are distinct. Which of the following statements about the minimum…

