MATHEMATICS

OF GRAPHS
 Core Idea

Mathematics
creates connections and
fosters efficiency through
visual tools like graphs
and algorithms.
Learning Outcomes

Support the use

of mathematics in
various aspects
and endeavors in
life
 Suggested Topics
• Euler Path Theorem
• Introduction to Graph
• Hamilton Circuit
• Constructing a Graph • Dirac’s Theorem
• Directed Graph • Weighted Graph
• Equivalent Graphs • Finding Hamiltonian
Circuits
• Complete Graph • Planar Graph
• Complement of G • Subgraph
• Degree of a Vertex • Nonplanar Graph
Theorem
• Konigsberg Bridge Puzzle • Graph Contraction
• Euler Circuits • Euler’s Formula
• Eulerian Graph Theorem • Graph Coloring
Introduction to Graphs
• It is a set of points called vertices and
line segments or curves connecting
these points called edges.
• These are used to represent
relations, connections, and networks.
• An edge that connects a vertex with
itself is called a loop.
Directed vs. Undirected Graph
Equivalent Graphs
Complete Graph (Kn)
Complement of a Graph and Degree
of a Vertex
Konigsberg Bridge Puzzle

Can you start at any vertex,

move through each edge once
(but not more than once), and
return to the starting point?
 Euler Circuits
• A path in a graph can be thought of as a
movement from one vertex to another by
traversing edges.
• Closed path or circuit is a path that ends at
the same vertex at which it started.
• Euler circuit is a circuit that uses every
edge, but never uses the same edge twice.
• If a path uses every edge once and only
once then such path is called an Euler path.
 Eulerian Graph Theorem

• A connected graph is Eulerian if and

only if every vertex of the graph is of
even degree.
 Eulerian Path Theorem

• 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.
• Every Euler path must start at one
of the vertices of odd degree and
end at the other.
Eulerian Path Theorem
 Hamilton Circuit

• A path that uses each vertex of a graph

exactly once.
 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 a degree of least n/2, then
the graph must be Hamiltonian.
Weighted Graph
 Finding Hamiltonian Circuits

• There is no known shortcut to find

the optimal Hamiltonian circuit in a
weighted graph.
• For complete graphs, there are two
algorithms:
The Greedy Method Algorithm
The Edge Picking Algorithm
 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 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..
Find a Hamiltonian circuit of minimum
weight starting at C using the Greedy
algorithm and edge picking algorithm.
 Planar Graph
• A graph that can drawn so that no edges
intersect each other (except at vertices)
• If the graph is drawn in such a way that no
edges cross, we say that we have a planar
drawing of the graph.
 Planar Graph

Show that the graph is planar.

 Subgraph

• A graph whose edges and vertices

come from the given graph, that is
not planar.
• Subgraph Theorem
– If a graph G has a subgraph that is not
planar, then G is also not planar. In
particular, if G contains the Utilities
Graph or K5 as a subgraph, G is not
planar.
 Subgraph

Show that the graph is not planar.

 Nonplanar Graph Theorem
• A graph is nonplanar if and only if it has
the Utilities Graph or K5 as a subgraph, or it
has a subgroup that can be contracted to
the Utilities Graph or K5.
 Graph Contraction

• A contraction of a graph is formed by

shrinking an edge until the two vertices
it connects come together and blend
into one. If in the process, the graph is
left with any multiple edges, we merge
them into one edge.
 Euler’s Formula

• In a connected graph drawn with

no intersecting edges, let v be the
number of vertices, e the number
of edges, and f the number of
faces. Then, v + f = e + 2.
 Graph Coloring

• A graph coloring is an assignment of

labels, called colors, to the vertices of
a graph such that no two adjacent
vertices share the same color.
• The chromatic number  of a graph  is
the minimal number of colors for which
such an assignment is possible. Other
types of colorings on graphs also exist,
most notably edge colorings that may
be subject to various constraints.
 Graph Coloring

A graph coloring for a graph with 6

vertices. It is impossible to color the graph
with 2 colors, so the graph has chromatic
number 3.