Chapter 1
Chapter 1
Chapter 1
HAMILTONIAN PATH
WEIGHTED GRAPH
PLANAR GRAPH
Introduction
Think of all the various connections we
experience in our lives
PATRICK
DON MEILIN
NOEMY LOUWIE
EMELYN
Graph Theory
Graph theory is a branch of mathematics that
illustrates and analyzes connections between objects,
people, events, etc.
A graph is a set of points called vertices (or nodes) and
line segments or curves called edges that connect
vertices.
Who discovered the Graph Theory?
Leonard Euler (April 15, 1707 –September 18, 1783)
= is a Swiss Mathematician and Physicist
= He started to work on graphs from year 1736
Graphs can be used to represent many
different scenarios:
Computer network of a small business
Matt ______ X X
Amber X _________ X X
Oscar X _________ X
Laura X X _________
Kaye X ________
Question :
1. Which student is involved in the most study group
with the others?
A Circuit that uses every edge, but never uses the same
edge twice is called an EULER CIRCUIT.
C
EULER CIRCUIT
If a path ends at the same vertex at which it started,
it is considered a closed path or circuit.
For the graph below, the path A-D-F-G-E-B-A is a
circuit. The path A-D-F-G-E-H is not a circuit.
EULER CIRCUIT
A circuit that uses every edge, but never uses the
same edge twice, is called an Euler circuit. (The
path may cross through vertices more than once).