525 views
0 votes
0 votes

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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
iarnav asked May 18, 2018
1,278 views
Is there a clique possible in Graph with one vertex? I mean, is a singleton vertex in itself is a complete sub-graph and can be called a clique.
1 votes
1 votes
1 answer
2
0 votes
0 votes
0 answers
3
Malusi asked Jan 12
88 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...