Welcome to Chapter 7 Lesson 2

EULER’S FORMULA
with Angel Pueblo and Andrei Nueva
TODAY WE'LL DISCUSS
1 OBJECTIVES

2 KEY TERMS

3 EULER’S CIRCUIT

4 EULER’S FORMULA

5 APPLICATION TO CIVIL ENGINEERING

COUNT ME UP!
How many sides do I have?
How many sides do I have?
How many sides do I have?
How many sides do I have?
 INTRODUCTION
It was shown that a circuit is a path that starts
and ends with the same vertex. In order to deal
with deeper graph theory, many more terms are
to be defined.
 TOPIC 1:
OBJECTIVES
Define key terms
Discussing the Euler Circuit
Use Euler’s Formula to solve problems
Giving practices about the Euler Circuit
Application of Euler’s Formula in
Engineering World
TOPIC 2: KEY
TERMS Connected Graph
Planar Graph
Leonhard Euler
Euler’s Circuit
Euler’s formula
face
CONNECTED GRAPH
Connected graphs are graphs in which any vertex can be reached from any other
vertex by tracing along edges.

This is a connected graph in which every possible edge is drawn between vertices
(without any multiple edges). Such a graph is called a complete graph.
PLANAR GRAPH
A planar graph is a graph that can be embedded in the plane, i.e., it can be drawn
on the plane in such a way that its edges intersect only at their endpoints. In other
words, it can be drawn in such a way that no edges cross each other.
LEONHARD EULER
Leonhard Euler was a Swiss mathematician, physicist, astronomer,
geographer, logician, and engineer who founded the studies of
graph theory and topology and made pioneering and influential
discoveries in many other branches of mathematics such as
analytic number theory, complex analysis, and infinitesimal calculus.
EULER’S CIRCUIT
An Euler circuit is a circuit that uses every edge in
a graph with no repeats. Being a circuit, it must
start and end at the same vertex.
EULER’S FORMULA
Euler’s formula, either of two important mathematical theorems of
Leonhard Euler. The first formula, used in trigonometry and also
called the Euler identity. The second, also called the Euler
polyhedra formula, is a topological invariance relating the number
of faces, vertices, and edges of any polyhedron.
FACE
F is part of the Euler Formula which officially
means the number of faces in the graph, including
the exterior face. It is written F + V = E + 2,
where V the number of vertices, and E the
number of edges. A cube, for example, has 6
faces, 8 vertices, and 12 edges and satisfies this
formula.
 TOPIC 3: EULER’S
CIRCUIT
Leonhard Euler first discussed and used Euler paths and circuits in 1736.
Rather than finding a minimum spanning tree that visits every vertex of a
graph, an Euler path or circuit can be used to find a way to visit every edge
of a graph once and only once. This would be useful for checking parking
meters along the streets of a city, patrolling the streets of a city, or delivering
mail.
 TOPIC 3: EULER’S
CIRCUIT
An Euler path - is a path that uses every edge of a graph exactly once. An Euler
path starts and ends at different vertices

An Euler circuit - is a circuit that uses every edge of a graph exactly once. An
Euler circuit starts and ends at the same vertex.
TOPIC 3: EULER’S
CIRCUIT
This Euler path travels every edge once and only once and starts and ends at different
vertices. This graph cannot have an Euler circuit since no Euler path can start and end
at the same vertex without crossing over at least one edge more than once.

Euler Path
TOPIC 3: EULER’S
CIRCUIT
This Euler path travels every edge once and only once and starts and ends at
the same vertex. Therefore, it is also an Euler circuit.

Euler Circuit
TOPIC 3: EULER’S
CIRCUIT
Euler Path Euler Circuit
 PRACTICE
Is this a Euler’s Path, a Euler’s Circuit? Why?

C
B

G
F
 PRACTICE
Answer:
It’s a Euler’s Circuit
C
B

G
F
 PRACTICE
Give the two Euler’s Circuit in this graph if the starting point is
letter A
 PRACTICE
Answers:
D
1 2
3
A E
4 5
9 6

B 8 C 7 F
A, E, C, A, B, C, F, E, D, A A, D, E, A, C, E, F, C, B, A
 PRACTICE
Get the one Eular’s Circuit in this graph if the starting point is
letter A
A

D
B
E

C
 PRACTICE
Answer:
A 1
7 4 D
B 2 A, D, E, B, D, C, A
3
6 E

C
 PRACTICE
There is only one Eular’s Path in this graph is there someone
who can figure this out?
C E
D
F A

B H
G
 PRACTICE
Answer:
C E
3
2
1
4 D
F A
8 7

5 9 A, F, C, E, G, B, H, D, G, H
B H
G

6
TOPIC 4: EULER’S FORMULA
Euler’s formula have two mathematical theorem; one
which is used in Trigonometry also known as Euler’s
Identity and the other is called Euler Polyhedra
Formula.

Euler’s Polyhedra Formula:

f=e-v+2
where:
f- face
e-edges
v-vertices
 TOPIC 4: EULER’S
FORMULA
Polyhedron (plural: polyhedra)-a three-dimensional solid with faces that are all flat
TOPIC 4: EULER’S
FORMULA
 PRACTICE
Count the number of faces, vertices, and edges of the
given polyhedron:
PRACTICE

Bottom
View

Top View
 PRACTICE
Count the number of faces, vertices, and edges of the
given polyhedron:

A tetrahedron have 4 vertices,

4 faces, and 6 edges
 PRACTICE
Count the number of faces, vertices, and edges of the
given polyhedron:

triangular prism
PRACTICE
 PRACTICE
If a square pyramid have 5 vertices and 8
edges, how many faces does it have?

f=e-v+2
 PRACTICE
If a square pyramid have 5 vertices and 8
edges, how many faces does it have?

f=e-v+2
Using the Euler Polyhedra Formula let’s find
the number of faces of a square pyramid f=(8)-(5)+2
f=e-v+2 f=3+2
f=5

So, a square pyramid have 5 faces.

 PRACTICE
If an octahedron have 8 faces and 12 edges,
how many vertices does it have?

f=e-v+2
 PRACTICE
If an octahedron have 8 faces and 12 edges,
how many vertices does it have?

Using the Euler Polyhedra Formula let’s find the number of vertices of an
octahedron
f=e-v+2
v=e+2-f
To find the number of edges we will first manipulate the formula to satisfy the
given facts.
v=(12)+(2)-8
v+f=e-v+2+v
v+f-f=e+2-f
f=14-8
v=e+2-f
v=6

So, an octahedron have 6 vertices.

 PRACTICE
If a dodecahedron have 20 vertices and 12
faces, how many edges does it have?

f=e-v+2
 PRACTICE
If a dodecahedron have 20 vertices and 12
faces, how many edges does it have?

Using the Euler Polyhedra Formula let’s find the number of edges of a
dodecahedron. e=f+v-2
f=e-v+2
To find the number of edges we will first manipulate the formula to e=(12)+(20)-2
satisfy the given facts.
f+(v-2)=e-v+2+(v-2) e=32-2
e=f+v-2
e=30

So, a dodecahedron have 30 edges.

 Polyhedra Viewer
https://polyhedra.tessera.li/
Application in Mathematics
https://webwork.moravian.edu
/100.2/sec_EulProbs.html
 TOPIC 5:
APPLICATION
Euler’s Formula allows a simple understanding of complex shapes and this
understanding is crucial for in Engineering we deal with structures with various
shapes and physical properties such as the following:
 SUMMARY
Euler’s formula is a simple formula, yet it is one of the most
important theories of all times. It is just one of the many concepts of
graph theory that is easily understood.

Euler’s circuit is a circuit that uses edges only once.

Euler’s formula have two mathematical theorem; one
which is used in Trigonometry also known as Euler’s
Identity and the other is called Euler Polyhedra Formula.
Euler’s Polyhedra Formula: f=e-v+2
THANK
YOU!