Scribd
Upload
89 views

Math of Graphs

The document discusses graphs and codes as elective lessons in a mathematics program. It provides details on the mathematics of graphs topic, including definitions of vertices, edges, paths, and circuits. It outlines Euler's proof in the 18th century that it is impossible to take a walk across all bridges in Konigsberg without crossing any twice, which was one of the first problems addressed in graph theory. A video clip then shows some real-life applications of graphs.

Uploaded by

david jenil nabua
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
89 views

Math of Graphs

The document discusses graphs and codes as elective lessons in a mathematics program. It provides details on the mathematics of graphs topic, including definitions of vertices, edges, paths, and circuits. It outlines Euler's proof in the 18th century that it is impossible to take a walk across all bridges in Konigsberg without crossing any twice, which was one of the first problems addressed in graph theory. A video clip then shows some real-life applications of graphs.

Uploaded by

david jenil nabua
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Graphs and Codes

 Math of Graphs and Math of Codes are two (2) of the “elective” lessons in MMW
 Other “electives” in MMW are Geometric Design, Linear Programming, Math of
Finance, Apportionment and Voting, Logic, and Mathematical Systems
 “Required” are Math in our World, Mathematical Language, Problem Solving and
Reasoning, and Data Management

HEB
Mathematics of Graphs
(also known in broader term as

Topics (and Subtopics)


Graph Theory)
 Graphs and Euler Circuits (e.g. Graphs, Euler Circuits, Eulerian Graph
Theorem, Euler Paths, Euler Path Theorem)
 Weighted Graphs (e.g. Hamiltonian Circuits, Dirac’s Theorem, Weighted
Graphs, The Greedy Algorithm, The Edge-Picking Algorithm, The
Traveling Salesman Problem)
 Planarity and Euler’s Formula (e.g. Planar Graph, Subgraph, The
Nonplanar Graph Theorem, Euler’s Formula)
 Graph Coloring (e.g. Representing Maps as Graphs, The Four-Color
Theorem, 2-Colorable Graph Theorem, Applications of Graph Coloring
 Trees
HEB
ON MATH OF GRAPHS
A graph is a set of points called vertices (also known as dots or
nodes), and line segments or curves called edges (also known as
links or borders) that connect the vertices.
Note: “Graph” as illustrated in Graph Theory is a very different kind
of graph. It is NOT the ordinary graph that we know such as that
of a bar graph, a line graph, the graph of a polynomial function, or
whatever.

HEB
Origin of Graph Theory: The Case of Konigsberg

The Konigsberg City (modern-day Kaliningrad, Russia) has four districts


surrounded by a river. Seven bridges connected these districts.

At that time, many citizens attempted (yet always failed!) to take a stroll that
would lead them across each bridge and return them to the starting
point WITHOUT traversing the same bridge twice.
HEB

A mathematician wondered; is it impossible? Or just difficult?


PEN-TRACING PUZZLE CHALLENGE:
“Redraw the resulting graph on your paper. Find a way to exactly
trace the diagram at the right without lifting your pen from the
paper and without tracing over the same segment twice. Is it
HEB

possible? Show.”
The 18th century Swiss mathematician
Leonhard Euler mathematically proved
that there is no such possibility (i.e. a
stroll that would lead one across each
bridge and return to the starting point
WITHOUT traversing the same bridge
twice).
One will definitely have to pass through
a bridge more than once.
The general proof was contained in his research paper
published in 1736 (and is considered as the first research in
Graph Theory).

HEB
Paths and Circuits
A Path in a graph results from a movement from one vertex to another by
traversing edges. If a path ends at the same vertex at which it
started, it becomes a closed path, or a Circuit. A circuit that uses
every edge, but never uses the same edge twice (though the path
may cross through vertices more than once), is an Euler Circuit.
There is no Euler Path in the resulting graph of the Konigsberg problem.
Nonetheless, granting that there was an additional bridge, , an Euler Path
may have existed, as shown:

HEB
Note: The graph in the Konigsberg problem is but “basic” as
compared with the resulting graphs of large systems such as that of a social
network :

 
 
 
 
 

HEB
Let’s watch
a video clip

for
some other
Real Life Applications
of Graphs
HEB (Note: 2 questions on Math of Graphs
will be asked after this…)
HEB
HEB
QUESTION 1:
Enumerate any three (3) of
the seven (7) real life
applications of Graph Theory
as shown/mentioned in the
video clip.
HEB
QUESTION 2.
Euler lived from 1707 to 1783.
Approximately how old was he
when he passed away?

HEB

You might also like