Let 𝐺(𝑉,𝐸) be a simple, undirected, edge-weighted graph with unique edge…

PYQ GATE 2026

1. A.

   In every cycle 𝐶 of 𝐺, the edge with the largest weight in 𝐶 is not in any MST

2. B.

   In every cycle 𝐶 of 𝐺, the edge with the smallest weight in 𝐶 is in every MST

3. C.

   For every vertex 𝑣 ∈𝑉, the edge with the largest weight incident on 𝑣 is not in any MST

4. D.

   For every vertex 𝑣 ∈𝑉, the edge with the smallest weight incident on 𝑣 is in every MST

Attempted by 85 students.