The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
71 views

For this proof ,proving

$\Rightarrow$ If Graph $G$ is eulerian then degree of each vertex is even with atmost one trivial component.

As $G$ is Eulerian ,it means it **must not** repeat Edges but can repeat vertices.Now for the Eulerian (path) traversal ,we pass through that vertex using two incident edges,one for entry and other for exit.

 

 

Then what is wrong  in this graph?

 

 

Here we have Eulerian path traversal as


$C\rightarrow A \rightarrow B \rightarrow D \rightarrow C \rightarrow F \rightarrow E \rightarrow H \rightarrow G \rightarrow F $

but here degree of $C,F =3$ contradictory....


help me out where i am wrong

 

asked in Graph Theory by (169 points) | 71 views
there exists eulerian path, but not eulerian circuit
Does Eulerain path do not follow property that every vertex of it must have even degree!!!???
no not

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,138 questions
36,959 answers
92,026 comments
34,803 users