Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 11 - Section 11.1 - Introduction to Trees - Exercises - Page 755: 2

Answer

a) is a tree b) is a tree d) is a tree f) is a tree

Work Step by Step

a) is a tree because it is connected and has no repeated path. b) is a tree because it is connected and has no repeated path. d) is a tree because it is connected and has no repeated path. f) is a tree because it is connected and has no repeated path.
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