#### Answer

The minimum spanning tree for a weighted graph is the spanning tree which has the smallest total weight.

#### Work Step by Step

The minimum spanning tree for a weighted graph is the spanning tree which has the smallest total weight. There could be numerous spanning trees for a given connected graph, and each spanning tree has its own total weight. The spanning tree which has the smallest total weight is called the minimum spanning tree.