Algorithms | Graph Minimum Spanning Tree | Question 5

An undirected graph G has n nodes. Its adjacency matrix is given by an n × 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 a 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

**Answer:** **(C)** **Explanation:** See Question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-22/

Quiz of this Question