Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - Chapter Summary, Review, and Test - Review Exercises: 36

Answer

This graph is not connected. Therefore, this graph is not a tree.

Work Step by Step

For any two vertices in a graph, if there is at least one path which has these two vertices as endpoints, then the graph is connected. A tree is a graph that is connected and does not have any circuits. Let's consider vertex D and vertex G. There is no path in this graph such that vertex D and vertex G are endpoints. Therefore, this graph is not connected. This graph is not connected. Therefore, this graph is not a 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.