Mathematics

of Graphs
Group 1
 Objectives:

To be able to have a grasp To be able to apple these concepts in

Of the basic concepts of graph planning and decision making
Theory. regarding networks and designs.
 7.1 Graph Theory
 in mathematics means the study of graphs. Graphs are one
of the prime objects of study in discrete mathematics.
 A. Drawing Graph s
 Graph drawing is an area of mathematics and computer
science combining methods from geometric graph theory
and information visualization to derive two-dimensional
depictions of graphs arising from applications such as
social network analysis, cartography, linguistics, and
bioinformatics.
 B. Graphs, Vertices, and Edges.
 Graph consists of a set of dots called,
Vertices(or nodes), and a set of Edges
connecting pairs of vertices.
 Swiss mathematician Leonhard Euler looked at this problem in 1735,
laying the foundation for graph theory as a field in mathematics.
 There are two edges connecting the North Bank to Island.
 Possible and reasonable to have more than one edge connecting two vertices.
 G = (V, E) consists of nonempty set of V of vertices (or nodes) and a
set of E of Edges. Each edge has either one or two vertices associated
with it, called endpoints. An edge is said to connect its endpoints.

G = (V, E) where
V = {a, b, c, d} and
E = {{a, b}, {a, c}, {b, c}, {b, d}, {c, d}}
Simple graph:
 Each edge connects two different vertices
 No two edges connect at the pair of vertices.
 C. Terminology
 VERTEX- dot in the paragraph.
 EDGES – connect pairs of vertices.
 LOOP – edge that connects a vertex
to itself.
 WALK
- Alternating sequence of
vertices and edges.
 Kinds of Walk
1. TRAIL
Walk in which no edge is repeated.
2. PATH
A trail in which no vertex is repeated.
 CONNECTED -there is a path from any vertex to any other
vertex.
 DISCONNECTED -there is no way to get from the vertices
on the left to the vertices on the right.
 WEIGHTS - distance between two locations, travel
time, or travel cost.
 7.2 Eulerian Graphs
 Euler's Graph - A graph is considered Eularian or Euler's
graph, if the graph is both connected and has a closed trail
(a walk with no repeated edges) containing all edges of the
graph.
 Euler's Graph Theorems
 Theorem 1: Euler Circuits An Euler circuit
is a circuit that uses every edge of a graph
with no repeats. Being a circuit, it must start
and end at the same vertex.
 Starting and ending at vertex A: ABCDECFGFCHA shown
in arrows.
 Why do we care if an Euler circuit exist?

Example: The police officer wanted to patrol a neighborhood

on foot by walking as little as possible. The ideal situation
would be a circuit that covers every street with no repeats.
 The neighborhood.
 The neighborhood converted to graph.
 The police officer start and end at the vertex E:
EDCBEFABE shown in arrows.
 Theorem 2: Euler's Paths
 An Euler's path is path that uses every edge in a graph with
no repeats. Being a path, it does not have to return to the
starting point.
 Start in vertex C and end at the vertex B: CABDCB
shown in arrows.
 Theorem 3 : Degrees of graphs
 In a graph theory, the degree of a vertex of a graph is
the number of edges that are incident to the vertex; in
a multigraph, a loop contributes 2 to a vertex's
degree, for the two ends of the edge.
 Degrees of graphs
 The degree (or valency) of a vertex of a graph is the
number of edges that are incident to the vertex; in a
multigraph, a loop contributes 2 to a vertex's degree, for the
two ends of the edge. The degree of a vertex is denoted.
 Lesson 7.3 Hamiltonian Graphs
 Hamiltonian graphs - any graphs that contains a
hamiltonian circuit.
 Hamiltonian Path
 A path on a connected graph that
passes through every vertex
exactly once.
 Hamiltonian Circuit
 Hamiltonian path that begins and
ends at the same vertex, but passes
through all vertices exactly once.
 Complete Graphs
 Are graphs in which every
possible edge is drawn between
vertices.
 Complete weighted graph
 Is a graph in which each edge is associated with
value, called a weight.
 Find Hamiltonian Circuits in a Weighted
Graph
 The graph below is a model graph for one way bus fares for
locations A, B, C, D. Use the weighted graph to find the cost of the
trip for Hamilton Circuit A, B, D, C, A.
 Brute Force Method
 The Optimal Solution is found using the following steps:

 1. Use the previous weighted graph to find the optimal solution.

- Model the problem with a complete, weighted graph.
 Make a list of all possible Hamilton Circuits.
 Determine the sum of the weights of the edges for each of
these Hamilton Circuits.
 The Hamilton circuit with the minimum sum of weights is
the optimal solution.
 2. A merchandiser for hardware products handling North Luzon
would like to look into the distance he has to travel in his area of
assignment. It will be simplier to analyze if we first organize the
information in a graph.
 DIRAC'S THEOREM
 Consider a connected graph with at least three (3) 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, the
graph must be HAMILTONIAN.
 ILLUSTRATIVE EXAMPLE

 1. Let G be a simple graph with n vertices where n > 3. If deg(v) is >

1/2 n for each vertex v, then G is Hamiltonian. Or deg(x) + deg(v) >
n.
 ORE'S THEOREM
 Gives a sufficient condition for a graph to be
Hamiltonian, essentially stating that a graph with
sufficiently many edges must contain a Hamilton
cycle.
 Let G be a simple graph with n vertices where n ≥ 2 if
deg(v) + deg(w) ≥ n for each pair of non-adjacent vertices v
and w, then G is Hamiltonian.
 7.4 Tree in Graph Theory
 Tree- A connected graph with no cycles.
 Branches- Edges of a tree.
 Nodes- Elements of a tree.
 Leaf nodes- Nodes without child nodes.
 Properties of tree

 1. If a graph is a tree ,there is one and only one path joining any
two vertices .conversely , if there is one and only one path
joining any two vertices of a graph, the graph must be a tree.
 Properties of tree

 2. In a tree , every edge is a bridge. Conversely , if every

edge of a connected graph is a bridge ,then the graph must
be a tree .
 Properties of tree

 3. A tree with n vertices must have n-1 edges.

 Properties of Tree
 4. A connected graph with n vertices n-1 edges
must be a tree.
 Forest

 It is a graph with each connected component of a tree.

 A disconnected acyclic graph , it is also a no cycle graph.
 Spanning Trees

 It is a subset of Graph G, which has all the vertices

covered with minimum possible number of edges.
 Circuit Rank

 Let 'G' be a connected graph with 'n' vertices and 'm'

edges. A spanning tree 'T' of G contains (n-1) edges.
 Kirchoff's Theorem

 Is useful in finding the number of the number of

spanning trees that can be formed from a connected
graph.
 7.5 Map Coloring
 Cartography: the act of assigning different colors to
different features on a map
 Mathematics: where the problem is to determine the
minimum number of colors needed to color a map so that
no two adjacent features have the same color.
 Map Coloring Guides
 Dots (nodes) = regions.
 Lines between two nodes= indicates that two regions
share a border.
 Map Coloring Guides
 Graph coloring problem- find the minimum number of
colors that are needed for a particular graph.
 Map Coloring Guide
 Coloring rule- no connected nodes should be colored the
same color.
 No limit to the number of colors.
 Minimum number of colors needed is called chromatic
number.
 Chromatic number of a Graph

 Minimum number of colors needed to color a graph

so that no edge connects vertices of the same color.