9780023606922, Chapter 2 6, Problem 25E

Prévia do material em texto

Chapter 2.6, Problem 25E Step-by-step solution Step 1 of 1 Explanation about the statement Supposed statement is It is a cycle. If, distinct simple paths from a to b in a simple graph G as in the following graph. Consider the following distinct simple paths from a to b in a simple graph The simple graph is as follows:- c a a b Since both paths from a to b. therefore = a = and Therefore initial and final vertices are same and there exists 2 distinct simple paths between them implies that: = is a cycle starting from a going in the path and going to b and coming back to ain a different path Therefore necessarily a cycle.