GATE CSE
First time here? Checkout the FAQ!
x
0 votes
47 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 (143 points)   | 47 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 May 2017
  1. akash.dinkar12

    3598 Points

  2. pawan kumarln

    2314 Points

  3. Bikram

    1958 Points

  4. Arjun

    1942 Points

  5. sh!va

    1682 Points

  6. Debashish Deka

    1296 Points

  7. Devshree Dubey

    1282 Points

  8. Arunav Khare

    1122 Points

  9. Angkit

    1072 Points

  10. LeenSharma

    1028 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 29 - Jun 04
  1. Arjun

    292 Points

  2. Arunav Khare

    246 Points

  3. Arnab Bhadra

    122 Points

  4. Rupendra Choudhary

    116 Points

  5. pC

    110 Points


22,912 questions
29,253 answers
65,411 comments
27,750 users