Q6

MCQ1 mark, −0.25

An undirected graph $G$ has $n$ nodes. its adjacency matrix is given by an $n \times n$ square matrix whose (i) diagonal elements are 0’s and (ii) non-diagonal elements are 1’s. Which one of the following is TRUE?

(A)

Graph $G$ has no minimum spanning tree (MST)

(B)

Graph $G$ has unique MST of cost $n-1$

(C)

Graph $G$ has multiple distinct MSTs, each of cost $n-1$

(D)

Graph $G$ has multiple spanning trees of different costs

Loading…