Q41

MCQ2 marks, −0.67

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}$ ?

(A)

All edges in $\text{G}$ have even weight

(B)

All edges in $\text{G}$ have even weight $\mathbf{O R}$ all edges in $\text{G}$ have odd weight

(C)

In each cycle $\text{C}$ in $\text{G}$ , all edges in $\text{C}$ have even weight

(D)

In each cycle $\text{C}$ in $\text{G}$ , either all edges in $\text{C}$ have even weight $\text{OR}$ all edges in $\text{C}$ have odd weight

Loading…