Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - 14.4 Trees - Exercise Set 14.4: 49

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.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.