Chapter 14 - Graph Theory - Chapter 14 Test - Page 939: 20

The minimum spanning tree includes the four edges CD, BD, DE, and AB. The total weight of the minimum spanning tree is 17.

Work Step by Step

We can use Kruskal's Algorithm to find the minimum spanning tree for the weighted graph. First, we choose the smallest weight, which is 2. We add the edge CD to the spanning tree. The next smallest weight is 3, so we add edge BD to the spanning tree. The next smallest weight is 5, so we add edge DE to the spanning tree. The next smallest weight is 7, so we add edge AB to the spanning tree. Now we have created a spanning tree that includes all the vertices, is connected, and does not have any circuits. The minimum spanning tree includes the four edges CD, BD, DE, and AB. We can find the total weight of the minimum spanning tree. total weight = 2 + 3 + 5 + 7 total weight = 17 The total weight of the minimum spanning tree is 17.

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.