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.4 - Spanning Trees - Exercises - Page 797: 43

Answer

-If an edge uv is not followed while we are processing vertex u during the depth-first search process, -then it must be the case that the vertex v had already been visited.

Work Step by Step

-If an edge uv is not followed while we are processing vertex u during the depth-first search process, -then it must be the case that the vertex v had already been visited. ----There are two cases. If vertex v was visited after we started processing u, then, - because we are not finished processing u yet, v must appear in the subtree rooted at u (and hence, must be a descendant of u). -On the other hand, if the processing of v had already begun before we started processing u, -then why wasn’t this edge followed at that time? -It must be that we had not finished processing v, --in other words, that we are still forming the subtree rooted at v, sou is a descendant of v, and hence, v is an ancestor of u.
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.