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: 45

Answer

If the tree has $n$ vertices, then the number of edges is $n-1$.

Work Step by Step

A tree is a graph that is connected and does not have any circuits. In a tree, there is a simple relationship between the number of vertices and the number of edges. If the tree has $n$ vertices, then the number of edges is $n-1$.
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.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions
GradeSaver will pay $500 for your Textbook Answer contributions