Q54
Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true? \[ M = [ array*20c 0&1&1 \\ 1&0&1 \\ 1&1&0 array ]\]
Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
{\text{M}} = \left[ {\begin{array}{*{20}{c}} 0&1&1 \\ 1&0&1 \\ 1&1&0 \end{array}} \right]
{\text{M}} = \left[ {\begin{array}{*{20}{c}} 0&1&1 \\ 1&0&1 \\ 1&1&0 \end{array}} \right]
A.
Graph M has no minimum spanning tree
B.
Graph M has a unique minimum spanning trees of cost 2
C.
Graph M has 3 distinct minimum spanning trees, each of cost 2
AnswerD.
Graph M has 3 spanning trees of different costs
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board