GATE CSE
First time here? Checkout the FAQ!
x
0 votes
34 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 (51 points)   | 34 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.

Related questions

Top Users Jan 2017
  1. Debashish Deka

    8978 Points

  2. sudsho

    5326 Points

  3. Habibkhan

    4798 Points

  4. Bikram

    4676 Points

  5. Vijay Thakur

    4496 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4216 Points

  8. Sushant Gokhale

    3834 Points

  9. santhoshdevulapally

    3808 Points

  10. Kapil

    3736 Points

Monthly Topper: Rs. 500 gift card

19,229 questions
24,123 answers
53,256 comments
20,323 users