The Answer to the Question
is below this banner.
Here's the Solution to this Question
Cycles in graphs are of two types :
- self loops
- 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.