Question

Every graph has only one minimum spanning tree.

(a) True

(b) False

I have been asked this question in an interview for job.

My question is based upon Minimum Spanning Tree topic in portion Minimum Spanning Tree of Data Structures & Algorithms II

Answer 1

The correct choice is (b) False

For 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.