Euler Path

Logic Level 1

Can we cover every edge in the given graph once and only once?

No, an Euler path does not exist Yes, an Euler Path exists It can not be determined

Hana Wehbi by Hana Wehbi , 51, USA

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Chris Sapiano
Nov 10, 2019

There are only 2 2 nodes of odd valency ( B B and C C ). Therefore we cover every edge in the given graph once and only once, if and only if you start at one of B B and C C and end at the other.

2 Helpful 0 Interesting 0 Brilliant 0 Confused

If 2 or less points have an odd number of edges, then a Euler path exists. If more than 2 points have an odd number of edges then a Euler Path doesn't exist

0 Helpful 0 Interesting 0 Brilliant 0 Confused

B --> A -- C --> D --> E --> D --> A --> E --> B

A Former Brilliant Member - 1 year, 6 months ago

Is the path

A Former Brilliant Member - 1 year, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...