Mumbai University > Computer Engineering > Sem 3 > Discrete Structures

Marks: 6 Marks

Year: May 2016

Eular path in a graph to be a path that traverses each edge in the graph once and only once. Similarly, we define an Eular circuit in a graph to be a circuit that traverses each edge in the graph once and only once.

Problem:

The graph is Eular graph because all the vertices of the graph are even.

The Eular circuit in the graph is A B C D A F E B D E

There is no vertex of odd degree; therefore the Eular can be obtained by removing the last vertex E in the

Eular path, i.e. A B C D A F E B D.

Hence the given graph has Eular path and Eular circuit.