PAMANTASAN NG LUNGSOD NG VALENZUELA

TONGCO ST., MAYSAN, VALENZUELA CITY

COLLEGE OF EDUCATION
MATHEMATICS DEPARTMENT

GE 4: MATHEMATICS IN THE MODERN WORLD

THE MATHEMATICS
OF GRAPHS
JUSTINE N. ASUNCION
LECTURER
Is there a way to
visit each land
mass using a
bridge only once
and beginning
and arriving at
the same point?

SEVEN BRIDGES OF KONIGSBERG

Leonhard Euler, 1735
SEVEN BRIDGES OF KONIGSBERG
(1735 )
A branch of mathematics that
illustrates and analyzes
connections.
It is a set of points called
vertices and line segments or
curves called edges that
connect vertices.
Example of Graphs:

connected not
null graph connected
(disconnect graph that connected; it graph
ed graph) has a pair of consists of two complete
multiple different
graph
edges sections. It
also contains
a loop.
The table lists five students at a college. An “X” indicates that the
two students participate in the same group this semester
The table lists five mobile phone companies and indicates whether
they have agreements to roam onto each other’s networks.
Two graphs are said to be
equivalent graphs if the
edges form the same
connections of vertices in
each graph
Note that it does not matter whether the edges are drawn
straight or curved, and their lengths and positions are not
important. Nor is the exact placement of the vertices
important.
NO

YES
PATH
A movement from one vertex to
another by traversing edges.
CIRCUIT (closed path)
A path that ends at the same vertex
which it started.
 CIRCUIT NOT
(closed path) a circuit
 B–D–F–G–H– E–C–B–A–D–G–E–B

A circuit
that uses
every edge,
but never
uses the NOT
same edge
twice. A–B–C–E–H–G–E–B–D–A A–B–C–E–H–G–F–D– A–B–E–G–D–A
A circuit that uses every edge, but
never uses the same edge twice.
A connected graph is Eulerian if
and only if every vertex of the
graph is of even degree.
Which of the following graphs has an Euler circuit?

NO EULER CIRCUIT
Which of the following graphs has an Euler circuit?
2
2 2

2 2

HAS AN EULER CIRCUIT

Which of the following graphs has an Euler circuit?

3 Is there a way to visit

each land mass using a
bridge only once and
beginning and arriving
at the same point?
5 3 IMPOSSIBLE!

3
NO EULER CIRCUIT
Which of the following graphs has an Euler circuit?

B–A–F–B–E–F–G–E–D–G–B–D–C–B

HAS AN EULER CIRCUIT

Would the citizens be able to complete a stroll
across each bridge and return to their starting
points without crossing the same bridge twice?

4
4
4 YES!
A connected graph contains an Euler path if and
only if the graph has two vertices of odd degree
with all other vertices of even degree.
Furthermore, every Euler path must start at one of
the vertices of odd degree and end at the other.
❑ If a graph is connected and has 0 or exactly 2 vertices of
odd degree, then it has at least one Euler path.
❑ Every Euler circuit is an Euler path, but not every Euler path is
an Euler circuit.
Which of the following graphs has an Euler
path?

HAS AN EULER PATH

ART GALLERY EULER PATH EXISTS!!!
FLOOR PLAN C–B–F–B–A–F–E–D– C–F–D
Is it possible to
take a stroll
that passes
through every
doorway
without going
through the
same doorway
twice? If so,
does it matter
whether we
return to the
starting point?
Hamiltonian Path: – It is a walk in a graph
that contains all vertices of the graph
such that no vertices are repeated.
Hamiltonian Circuit: – starts and ends at
the same vertex that visit each vertex
exactly once (except for the endpoint).
A Hamiltonian circuit is a path that uses each
vertex of a graph exactly once. A graph that
contains a Hamiltonian circuit is called
Hamiltonian.
Dirac’s Theorem
Consider a connected graph with at least three vertices
and no multiple edges. Let n be the number of vertices
in the graph. If every vertex has degree of at least n/2,
then the graph must be Hamiltonian.
 n=6

Every vertex has

a degree of at
least n/2 = 3

Portland - Boise - Butte - Salt Lake City - Reno - Sacramento - Portland

 n=7

Every vertex has

a degree of at
least n/2 = 3.5

Los Angeles - New York - Boston - Atlanta - Dallas -Phoenix -

San Francisco - Los Angeles.
A weighted graph is
a graph in which
each edge is
associated with a
value, called a
weight.
The table below lists the distances in miles between six
popular cities that a particular airline flies to. Suppose a
traveler would like to start in Chicago, visit the other five
cities this airline flies to, and return to Chicago. Find three
different routes that the traveler could follow, and find the
total distance flown for each route.
 Chicago–New York–Dallas–
Philadelphia–Atlanta–
Washington, D.C.–Chicago
713 + 1374 + 1299 + 670 + 544 + 597 = 𝟓𝟏𝟗𝟕

Chicago–Philadelphia– Dallas–
Washington, D.C.–Atlanta–New
York–Chicago
665 + 1299 + 1185 + 544 + 748 + 713 = 𝟓𝟏𝟓𝟒

Chicago–Washington, D.C.–
Dallas–New York–Atlanta–
Philadelphia– Chicago
597 + 1185 + 1374 + 748 + 670 + 665 = 𝟓𝟐𝟑𝟗
Note: Algorithms apply only to complete graphs—graphs in which every
possible edge is drawn between vertices (without any multiple edges)

The Greedy Algorithm

1. Choose a vertex to start at, then travel along the
connected edge that has the smallest weight. (If two or
more edges have the same weight, pick any one.)
2. After arriving at the next vertex, travel along the edge
of smallest weight that connects to a vertex not yet
visited. Continue this process until you have visited all
vertices.
3. Return to the starting vertex.
The Greedy Algorithm
Start at vertex A.

A- D -B -F -E -C -A
4+ 2+ 5+ 10+ 6+ 15=42
The Greedy Algorithm
Start at vertex A. A-D-C-B-E-A
5+4+3+5+9 =26
The Edge-Picking Algorithm
1. Mark the edge of smallest weight in the graph.
(If two or more edges have the same weight, pick
any one.)
2. Mark the edge of next smallest weight in the graph,
as long as it does not complete a circuit and does
not add a third marked edge to a single vertex.
3. Continue this process until you can no longer mark
any edges. Then mark the final edge that
completes the Hamiltonian circuit.
The Edge-Picking Algorithm

A-D-B-F-C–E-A
4+2+5+14+6+5=36
BD = 2
A-E-C-F-B-D-A AD = 4
5+6+14+5+2+4=36 FB = 5
AE = 5
EC = 6
FC = 14
The Edge-Picking Algorithm

A-D-C-B-E-A
5+4+3+5+9 BC = 3
=26 CD = 4
AD = 5
BE = 5
AE = 9
Dora needs to mail a package at the post office, pick up several
items at the grocery store, return a rented video, and make a
deposit at her bank. The estimated driving time, in minutes,
between each of these locations is given in the table below.
The Greedy Algorithm HOME -
Start at vertex Home. GROCERY STORE -
POST OFFICE -
VIDEO RENTAL -
BANK - HOME

12+8+12+18+23
= 73 MINUTES
The Edge-Picking Algorithm PO-GS = 8
B-GS = 11
PO-VRS = 12
H-VRS = 20
H-B = 23

HOME -VIDEO
RENTAL STORE -
POST OFFICE -
20+12+8+11+23 GROCERY STORE -
= 74 MINUTES BANK - HOME
The Chromatic Number of a Graph
The minimum number of colors needed to color a
graph so that no edge connects vertices of the
same color

2-Colorable Graph Theorem

A graph is 2-colorable if and only if it has no
circuits that consist of an odd number of vertices.
Five classes at an elementary school have arranged a tour at a
zoo where the students get to feed the animals.

Class 1 wants to feed the elephants, giraffes, and hippos.

Class 2 wants to feed the monkeys, rhinos, and elephants.
Class 3 wants to feed the monkeys, deer, and sea lions.
Class 4 wants to feed the parrots, giraffes, and polar bears.
Class 5 wants to feed the sea lions, hippos, and polar bears.

If the zoo allows animals to be fed only once a day by one class of
students, can the tour be accomplished in two days? (Assume that
each class will visit the zoo only on one day.) If not, how many
days will be required?
Five classes at an elementary
school have arranged a tour at a
zoo where the students get to feed
the animals.

Class 1 wants to feed the

elephants, giraffes, and hippos.
Class 2 wants to feed the monkeys,
rhinos, and elephants.
Class 3 wants to feed the monkeys,
deer, and sea lions.
Class 4 wants to feed the parrots,
giraffes, and polar bears. 1st Day: Class 1 and 3
Class 5 wants to feed the sea lions, 2nd Day: Class 2 and 5
hippos, and polar bears. 3rd Day: Class 4
Eight different school clubs want to schedule
meetings on the last day of the semester.
Some club members, however, belong to
more than one of these clubs, so clubs that
share members cannot meet at the same
time. How many different time slots are
required so that all members can attend all
meetings? Clubs that have a member in
common are indicated with an “X” in the
table below
1st time slot: SC, DC, SN
2nd time slot: CO, SG
3rd time slot: CR, CD, HS