Q38

MCQ2 marks, −0.67

Let $G$ be any connected, weighted, undirected graph. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II

(A)

$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.

(B)

$G$ has a unique minimum spanning tree, if, for every cut of $G$ , there is a unique minimum-weight edge crossing the cut.

Loading…