Determine Euler cycle and path in graph shown below

2.1kviews

written 5.6 years ago by

teamques10 ★ 68k

modified 2.8 years ago by

pradnyanabar2613 ★ 5.2k

data structures and algorithms

ADD COMMENT EDIT

1 Answer

61views

written 2.8 years ago by

pradnyanabar2613 ★ 5.2k

enter image description here

Solution:

Let G be the given graph.

enter image description here

def(a) = 3

def(b) = 4

def(c) = 3

def(d) = 6

def(e) = 4

def(f) = 3

def(g) = 3

$\because$ The def of each vertex is not EVEN

$\therefore$ eulerian circuit is not present in Graph G

$\therefore$ Graph G is not eulerian graph.

$\therefore$ eulerian path is not present in G

$\therefore$ No eulerian path exist in G.

ADD COMMENT EDIT

Please log in to add an answer.