Let $\text{G}$ be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in $\text{G}$ has even weight. Which of the following statements is/are TRUE for every such graph $\text{G}$?
Note that the given question is about Spanning Tree, Not about Minimum Spanning Tree.
Detailed Video Explanation: Spanning Tree Even Weight - GATE CSE 2024
Find counter-examples for option A,B,C in the above video solution.
I think the best approach would be to take counter examples for each case.
P.S. there may be better ways to solve this
64.3k questions
77.9k answers
244k comments
80.0k users