Discrete Structure20825 marksEuler paths and circuits
Mention the necessary and sufficient conditions for Euler path and Euler circuit with example.
Mention the necessary and sufficient conditions for Euler path and Euler circuit with example. [5]
- Euler Path: A path in a graph that visits every edge exactly once. - Euler Circuit: A closed path (circuit) in a graph that visits every edge exactly once and starts and ends at the same vertex. --- A connected graph G has an Euler Path if and only if it has exactly two vertices of odd degree. ...