Scribd
Upload
499 views

Euler Circuit/Path Examples

The document contains 10 examples of graphs and questions about determining if they have an Euler path, Euler circuit, or neither based on Euler's theorem. For graphs that have an Euler path or circuit, there are additional questions about finding one with specific vertex orders.

Uploaded by

Omar Moreno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
499 views

Euler Circuit/Path Examples

The document contains 10 examples of graphs and questions about determining if they have an Euler path, Euler circuit, or neither based on Euler's theorem. For graphs that have an Euler path or circuit, there are additional questions about finding one with specific vertex orders.

Uploaded by

Omar Moreno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

§14.

2 Examples
1. Use the graph to determine whether the path described is an Euler path, an Euler circuit,
or neither. Explain your answer.
A, C, E, D, C, B, F, E, B, A

The path described is

2. Use the graph to determine whether the path described is an Euler path, an Euler circuit,
or neither. Explain your answer.
F, B, D, C, B, A, E, D, A

The path described is

3. Consider the following graphs and determine whether they have an Euther path, Euler
circuit or neither
Graph Choices
Euler Path ☐

Euler Circuit ☐

Neither ☐

Euler Path ☐

Euler Circuit ☐

Neither ☐
Euler Path ☐

Euler Circuit ☐

Neither ☐

Euler Path ☐

Euler Circuit ☐

Neither ☐

Euler Path ☐

Euler Circuit ☐

Neither ☐

4. Explain why the graph shown to the right has no Euler paths and no Euler circuits.

By Euler's Theorem, the graph has no Euler paths and no Euler circuits because it has

5. Explain why the graph shown to the right has no Euler paths and no Euler circuits.

By Euler's Theorem, the graph has no Euler paths and no Euler circuits because it has
6. A graph is given below

a. Does the graph have an Euler path, an Euler circuit or neither?


b. If the graph has an Euler path or an Euler circuit, use trial and error or Fleury's
Algorithm to find one whose third vertex is C and fourth vertex is B.

7. A graph is given below

a. Does the graph have an Euler path, an Euler circuit or neither?


b. If the graph has an Euler path or an Euler circuit, use trial and error or Fleury's
Algorithm to find one whose third vertex is C and fourth vertex is B.

8. A graph is given below

a. Does the graph have an Euler path, an Euler circuit or neither?


b. If the graph has an Euler path or an Euler circuit, use trial and error or Fleury's
Algorithm to find one whose third vertex is C and fourth vertex is B.
9. A graph is given below

a. Does the graph have an Euler path, an Euler circuit or neither?


b. If the graph has an Euler path or an Euler circuit, use trial and error or Fleury's
Algorithm to find one whose third vertex is C and fourth vertex is B.

10. A graph is given below

a. Does the graph have an Euler path, an Euler circuit or neither?


b. If the graph has an Euler path or an Euler circuit, use trial and error or Fleury's
Algorithm to find one whose third vertex is C and fourth vertex is B.

You might also like