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 - Page 933: 57

Answer

This graph is a tree with six vertices whose degrees are 1, 1, 2, 2, 2, and 2.

Work Step by Step

This graph is connected and does not have any circuits. Therefore, this graph is a tree. Vertex E and vertex F have degrees of 1. The other vertices have degrees of 2. This graph is a tree with six vertices whose degrees are 1, 1, 2, 2, 2, and 2.
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.