mgf1107lecture14 - Ex Recall that we can represent the...

Info icon This preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
MGF 1107 – EXPLORATIONS IN MATHEMATICS LECTURE 14 We are now in a position to introduce Euler’s theorem, which is used to determine if a graph contains Euler paths and Euler circuits. Euler’s Circuit Theorem i) If a graph is connected and every vertex is even, then there exists at least one Euler circuit (which we can start and end at any vertex). ii) If any graph has an odd vertex then no Euler circuits exist. Ex.
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon