I have read in many places that one necessary condition for the existence of a Euler circuit in a directed graph is as follows.(adsbygoogle = window.adsbygoogle || []).push({});

Theorem: "A directed graph has an eulerian circuit if and only if it is connected and each vertex has the same in-degree as out-degree."

However, I don't understand why the state of being connected is a necessary condition. I thought that a Euler circuit is a closed walk where all of the edges are distinct and uses every edge in the graph exactly once. Therefore, the disconnected graph shown below should satisfy the condition of being a Euler circuit. (All the edges in the graph are used exactly once).

Can anyone explain what I did wrong here? Also it would be greatly appreciated if someone could give a mathematical proof to both parts of the theorem.

Thanks!

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# I Graph Theory: (proof)conditions for Euler Circuit in Digraph

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Graph Theory proof | Date |
---|---|

I Use of irrational numbers for coordinate system | Sep 12, 2017 |

I Spectral Bisection of Simplest Graph Clearly Incorrect | Aug 18, 2017 |

I The complete graph K_n can be expressed as the union of k bipartite graphs iff n≤2^k | Jun 26, 2017 |

I The largest n such that K_n can be expressed as the union of | Apr 26, 2017 |

I Graph Theory: I need help understanding the corollaries | Apr 14, 2017 |

**Physics Forums - The Fusion of Science and Community**