P a g e | 174

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits
 P a g e | 175

Overview/Introduction

Learning Outcomes

At the end of this lesson, the students are expected to:

1. Describe what graph is and its types.

2. Distinguish Eulerian from Hamiltonian graph and its circuit from the given graph.
3. Draw the graph based on the given conditions.

Learning Experiences and Self-Assessment Activities (SAA)

(Read and analyze the attached handout on “Traveling Roads and Visiting Cities”)

✓ Test Your Understanding

1. What is graph?
2. What are the different types of graphs? State its characteristics.
3. How is an Eulerian graph differed from Hamiltonian graph?

Summary/Key Points

• Eulerian Graph Theorem

A connected graph is Eulerian if and only if every vertex of the graph is of even degree.

• Euler Walk Theorem

A connected graph contains an Euler walk if and only if the graph has two vertices of odd degree
and the remaining vertices are of even degree. Furthermore, every Euler walk must start at one of the
vertices of odd degree and end at the other.

• Hamiltonian Graphs and Dirac’s Theorem

Dirac’s Theorem states that in a connected graph with at least three vertices and with no multiple
edges, if n is the number of vertices in the graph and every vertex has degree of at least n/2 then the graph
must be Hamiltonian. If it is not the case that every vertex has degree of at least n/2 then the graph may
or may not be Hamiltonian.

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits
 P a g e | 176

SAA Answer Sheet

1. ______________________________________________________________________________
______________________________________________________________________________
2. ______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________
3. ______________________________________________________________________________
______________________________________________________________________________
______________________________________________________________________________

End of Module Assessment (EMA)

✓ Test Your Mastery

1. In exercise below, (a) give the number of edges in the graph, (b) give the number of vertices in
the graph, (c) determine the number of vertices that are of odd degree, (d) determine whether
the graph is connected, and (e) determine whether the graph is a complete graph.

2. An “X” in the table below indicates a direct train route between the corresponding cities. Draw a
graph to represent this information, in which each vertex represents a city and an edge connects
two vertices if there is a train route between the corresponding cities.

3. Explain why the following two graphs cannot be equivalent.

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits
 P a g e | 177

4. In exercise below, (a) determine whether the graph is Eulerian. If it is, find an Euler circuit. If it is
not, explain why. (b) If the graph does not have an Euler circuit, does it have an Euler walk? If so,
find one. If not, explain why.

5. Use Dirac’s Theorem to verify that the graph is Hamiltonian. Then find a Hamiltonian circuit.

SAA Answer Key

All answers are correct. No wrong responses will be considered if those are based on the above discussion.

Looking Ahead

✓ Synapse Strengtheners
1. Problem Solving. A group of friends is represented by the below. An edge connecting two names
means that the two friends have spoken to each other in the last week.

a. Have John and Stacy talked to each other in the last week?
b. How many of the friends in this group has Steve talked to in the last week?
c. Among this group of friends, who has talked to the most people in the last week?
d. Why would it not make sense for this graph to contain a loop?

2. Graph Construction.
a. Draw a connected graph with six vertices that has no Euler circuits and no Hamiltonian circuits.
b. Draw a graph with six vertices that has a Hamiltonian circuit but no Euler circuits.
c. Draw a graph with five vertices that has an Euler circuit but no Hamiltonian circuits.

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits
 P a g e | 178

Self and Module Evaluation

1. Overall, how satisfied were you with the learning module?

o Very satisfied
o Satisfied
o Somewhat satisfied
o Dissatisfied
o Very dissatisfied

2. Was the module easy to follow?

o Very easy
o Somewhat easy
o Somewhat difficult
o Very difficult

3. How long did it take you to complete the module? __________

4. The length of the module was:

o Too short
o Too long
o Just right

5. Did the learning module allow you to expand your knowledge of the topic?

o Yes
o Somewhat
o No

6. Was the module well structured, clear and easy to understand?

o Yes
o Somewhat
o No

7. Did the module fulfill its objectives?

o Yes
o Somewhat
o No

8. What did you like most about this module?

_____________________________________________________________________________________
_____________________________________________________________________________________

9. In what way(s) could this module be improved?

_____________________________________________________________________________________
_____________________________________________________________________________________

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits
 P a g e | 179

10. Do you have any other comments, suggestions, or feedback that will help us make improvements to
future learning modules?

_____________________________________________________________________________________
_____________________________________________________________________________________

References
Richard Aufmann, et. al. 2010. Mathematical Excursions. Nelson Education, Ltd.: Canada

Unit 6.1 mathematics of graphs

Graphs and Euler Circuits