Answer
Showing that every finite simple graph has a spanning forest.
Work Step by Step
-Take the union of the spanning trees of the connected components of G.
- They are disjoint,
- so the result is a forest.
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
Published by
McGraw-Hill Education
ISBN 10:
0073383090
ISBN 13:
978-0-07338-309-5
Chapter 11 - Section 11.4 - Spanning Trees - Exercises - Page 796: 31
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter 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.
