Answer to Question #110326 in Discrete Mathematics for Ramu

Question

Prove: If e is an edge in a simple closed path in G, then e belongs to some cycle.

Answer 1

Cycles in graphs are of two types :

1. self loops
2. simple closed paths.

Thus, a simple closed path is always a cycle (but vice versa is not true).

Now, if e is an edge in a simple closed path, means e belongs to a simple closed path in the graph.

And as every simple closed path is a cycle.

Thus, e belongs to some cycle in the graph.

Hence proved.