An undirected graph G has n nodes. Its adjacency matrix M is given by an n×n square matrix whose diagonal elements (M[i][i], 1 ≤ i ≤ n) are all zeroes and the rest of its elements are ones. Which one of the following is TRUE?

Question

Accepted Answer

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

Answer

Graph G has multiple spanning trees of different costs.

Answer

Graph G has a unique MST of cost n-1.

Answer

Graph G has no minimum spanning tree (MST)

Crowdly

An undirected graph G has n nodes. Its adjacency matrix M is given by an n×n squ...

Want instant access to all verified answers on moodle.spit.ac.in?