1,221 views
3 votes
3 votes

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?

1) Graph G has multiple spanning trees of different costs

2) Graph G has multiple distinct MSTs, each of cost n-1
3) Graph G has a unique MST of cost n-1
4) Graph G has no minimum spanning tree (MST)
 

1 Answer

Related questions

0 votes
0 votes
1 answer
1
atulcse asked Jan 13, 2022
476 views
How many minimum spanning trees are possible in this graph?
0 votes
0 votes
0 answers
2
4 votes
4 votes
1 answer
4
srestha asked Apr 30, 2018
3,102 views
1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...