Concept drill
connectivity
GATE CSE & IT · Graph Theory - Connectivity / Minimum Spanning Tree · 2008-2025
2
PYQs
100%
keyed
0
elite explanations
2
years appeared
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →2025 Q10
The diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect...
mediumanswer key
2008 PYQ
$$G$$ is a graph on $$n$$ vertices and $$2n-2$$ edges. The edges of $$G$$ can be partitioned into two edge-disjoint spanning trees. Which of the following in NOT true for $$G$$?
hardanswer key