Thinking Mathematically (6th Edition)

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

Chapter 14 - Graph Theory - 14.2 Euler Paths and Euler Circuits - Concept and Vocabulary Check: 6

Answer

E, E, D

Work Step by Step

A connected graph has even vertices A, B, and C, and odd vertices, D and E. Each Euler path must begin at vertex D and end at vertex E, or begin at vertex E and end at vertex D.
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.