Answer
tree, bridge, n-1
Work Step by Step
A graph that is connected and has no circuits is called a tree. For such a graph, every edge is a bridge. For such a graph, if there are $n$ vertices, there must be $n-1$ edges.
Thinking Mathematically (6th Edition)
by Blitzer, Robert F.
Published by
Pearson
ISBN 10:
0321867327
ISBN 13:
978-0-32186-732-2
Chapter 14 - Graph Theory - 14.4 Trees - Concept and Vocabulary Check - Page 930: 1
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.
