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 - Exercise Set 14.2: 42

Answer

(a) If we remove the edge BJ, then the resulting graph will have no zero odd vertices, so the graph will have at least one Euler circuit. (b) A,B,C,D,E,F,O,N,M,I,N,E,G,D,M,L,K,H,L,C,H,B,K,J,A is an Euler circuit.

Work Step by Step

(a) We need to verify the number of odd vertices in the graph. Vertex B and vertex J are odd vertices and the other vertices are even. For a graph to have at least one Euler circuit, the number of odd vertices must be 0. If we remove the edge BJ, then both vertex B and vertex J will be even vertices. The resulting graph will have no zero odd vertices, so the graph will have at least one Euler circuit. (b) To find an Euler circuit, we can start at any vertex. Let's start at vertex A. According to Fleury's Algorithm, we should always choose an edge that is not a bridge, if possible. Since the edges AB and AJ are not bridges, we can choose either of these edges as the next step in the path. From vertex A, the path can travel to vertex B, then to vertex C, then to vertex D, then to vertex E, then to vertex F, then to vertex O, then to vertex N, and then to vertex M. At this step, we can see that the edge LM is a bridge, so according to Fluery's Algorithm, we must choose a different edge. The path can then travel to vertex I. At this step, the path must then travel to vertex N, then to vertex E, then to vertex G, then to vertex D, then to vertex M, and then to vertex L, because these are the only available edges. The path can then travel to vertex K. At this step, we can see that the edge JK is a bridge, so according to Fluery's Algorithm, we must choose a different edge. The path can then travel to vertex H, and then to vertex L. From here, the path must travel to vertex C, then to vertex H, then to vertex B, then to vertex K, then to vertex J, and then finally back to vertex A, because these are the only available edges. This path is A,B,C,D,E,F,O,N,M,I,N,E,G,D,M,L,K,H,L,C,H,B,K,J,A. This path travels through every edge of the graph exactly once, so it is an Euler path. Since it starts and ends at the same vertex, this path is an Euler circuit. This is one Euler circuit but there are other Euler circuits in this graph also.
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.