Every graph has only one minimum spanning tree.
|Answer» B. false|
|Explanation: minimum spanning tree is a spanning tree with the lowest cost among all the spacing trees. sum of all of the edges in the spanning tree is the cost of the spanning tree. there can be many minimum spanning trees for a given graph.|
Login to Continue
It will take less than 2 minutes