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 930: 4


This graph is not a tree because this graph is not connected.

Work Step by Step

A tree is a graph that is connected and has no circuits. A graph is connected when there is a path between every pair of vertices. Clearly the graph in this question is not connected. For example, let's consider vertex D and vertex E. There is no path in the graph which connects vertex D and vertex E. Therefore, this graph is not connected. Since this graph is not connected, 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.