Let 𝐺 be an undirected connected graph in which every edge has a positive…
PYQ GATE 2024
Let 𝐺 be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in 𝐺 has even weight. Which of the following statements is/are TRUE for every such graph 𝐺 ?
- A.
All edges in 𝐺 have even weight
- B.
All edges in 𝐺 have even weight OR all edges in 𝐺 have odd weight
- C.
In each cycle 𝐶 in 𝐺, all edges in 𝐶 have even weight
- D.
In each cycle 𝐶 in 𝐺, either all edges in 𝐶 have even weight OR all edges in 𝐶 have odd weight
Attempted by 223 students.
Sign up free to check your answer
Sign up freeLoading lesson…

