An undirected graph G has n nodes. Its adjacency matrix is given by an n × n…
GATE · 2005 · CS
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 l's. Which one of the following is TRUE?
- A.
Graph C 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
Attempted by 276 students.
Sign up free to check your answer
Sign up freeLoading lesson…