GATE CS 2024 (Afternoon) — Question 51

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MSQ2 marksHard

Let \( G \) be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in \( G \) has even weight. Which of the following statements is/are TRUE for every such graph \( G \)?
  1. A
    All edges in \( G \) have even weight.
  2. B
    All edges in \( G \) have even weight OR all edges in \( G \) have odd weight.
  3. C
    In each cycle \( C \) in \( G \), all edges in \( C \) have even weight.
  4. D
    In each cycle \( C \) in \( G \), either all edges in \( C \) have even weight OR all edges in \( C \) have odd weight
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group