42.euler Graph
42.euler Graph
Euler Path/tour: A path in a graph in which every edge is visited only once
Euler Circuit: An euler path in which starting and ending vertex are same (ie) a path in which every edge
is visited only once and starting and ending vertex are same. Every euler circuit is also an euler path
Euler Graph: A graph which contains an euler circuit is called Euler graph
SemiEuler graph: A graph which contains an euler path is called Semieuler graph
A vertex can be visited any number of times in euler path or circuit. We have to consider only the edges
in the graph
Important points:
Only zero or two vertices have odd degree and all other vertices have even degree
3. If more than 2 vertices have odd degree then there is no euler path or circuit in that graph
Example:
Vertices 1 and 3 have odd degree. Remaining vertices have even degree
Euler path present in that graph[start from one odd degree vertex and end at another odd degree
vertex]
This graph is called semieuler graph
All vertices have even degree
Euler circuit present in that graph
This graph is called Euler graph
More than 2 vertices have odd degree there is no euler path or circuit
Example 1:
Since in the given graph all vertices are having even degree, Euler circuit is possible
The Euler Circuit in above graph is 0->1->2->3->4->0
Exercise problem
1. Check whether the below graph is an Euler graph or not. If it is an Euler graph find the Euler
circuit otherwise find the Euler path