Determine Euler Cycle and path in graph shown below

1.5kviews

written 8.0 years ago by

teamques10 ★ 69k

modified 2.9 years ago by

pedsangini276 • 4.8k

Mumbai University > Computer Engineering > Sem 3 > Discrete Structures

Marks: 4 Marks

Year: May 2015

discrete mathematics

ADD COMMENT EDIT

1 Answer

45views

written 8.0 years ago by

teamques10 ★ 69k

enter image description here

The Eular circuit in the graph is a c d a b f e b g e d a

There is no vertex of odd degree; therefore the Eular can be obtained by removing the last vertex a in the Eular path, i.e. a c d a b f e b g e d.

Hence the given graph has Eular path and Eular circuit.

ADD COMMENT EDIT

Please log in to add an answer.