Euler Paths and Circuits Explained

Publicado el: 24 febrero 2021
en el canal de: Study Force

19,742

225

✔ https://StudyForce.com
✔ https://Biology-Forums.com
✔ Ask questions here: https://Biology-Forums.com/index.php?...

Follow us:

▶ Facebook:   / studyforceps
▶ Instagram:   / biologyforums
▶ Twitter:   / studyforceps

An Euler path is a path that travels through every edge of a graph once and only once.
Each edge must be traveled and no edge can be retraced.

An Euler circuit is a circuit that travels through every edge of a graph once and only once.
Like all circuits, an Euler circuit must begin and end at the same vertex.

Euler's Theorem (for connected graphs):
a. If a graph has exactly two odd vertices, then it has at least one Euler path, but no Euler circuit. Each Euler path must start at one of the odd vertices and end at the other one.
b. If a graph has no odd vertices (all even vertices), it has at least one Euler circuit (which, by definition, is also an Euler path). An Euler circuit can start and end at any vertex.
c. If a graph has more than two odd vertices, then it has no Euler paths and no Euler circuits.

Q. Given the graph in the figure:

a) Explain why it has at least one Euler path.

b) Use trial-and-error to find one such path

Q. Is it possible to walk across all 7 bridges without having to re-cross any of them?

En esta página del sitio puede ver el video en línea Euler Paths and Circuits Explained de Duración hora minuto segunda en buena calidad , que subió el usuario Study Force 24 febrero 2021, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 19,742 veces y le gustó 225 a los espectadores. Disfruta viendo!