MATHEMATICS

OF
GRAPHS
MODULE 8
OBJECTIVES
• Characterize and construct different kinds of graphs;
• Differentiate Eulerian graphs and Hamiltonian graphs;
• Use mathematical concepts and tools in other areas such
as networks, circuits and systems.
TOPICS
1. Basic Concepts of Graph Theory
2. Eulerian Graphs
3. Hamiltonian Graphs
 Basic
Concepts of
Graph Theory
• GRAPH – collection of vertices (also
called points or nodes) and edges (or
lines).
• The set V(G) is called vertex set of G
• The set E(G) is called the edge set of G
Example:
G = ( V(G) , E(G) )
where V(G) = { a, b, c , d , e }
E(G) = { ab, cd, be, ae }

G:
• The number of vertices in a graph G is
called its ORDER (p)
• The number of edges on a graph G is called
its SIZE (q)

G:
Order of G = p = 5
Size of G = q = 6
• The ends of an edge are said to be
INCIDENT with the edge, and vice versa
• Two vertices which are incident with a
common edge are ADJACENT as are two
edges which are incident with a common
vertex

G: • V1 is incident with
edge v1v4
• V3 and v2 are
adjacent
• An edge with identical ends is called a
LOOP
• An edge with distinct ends is called a LINK
TRIVIAL GRAPH
G: ● a
a graph with just one vertex
all other graphs are called NONTRIVIAL

SIMPLE GRAPH
• a graph with no G:
loops and no two
of its links join
the same pair of
vertices
COMPLETE GRAPH is a simple graph in
which each pair of distinct vertices is joined
by an edge. It is donated by Kn.
EMPTY GRAPH is a graph with no edges.

G1:

G2: ● ●
● ●
VERTEX DEGREES

The degree of a vertex V is the number of

edges of G incident with v, each loop
counting as two edges

a b
• d(a) = 3
c • d(f) = 5
d
• d(c) = 4
g e
f
• A graph G is K-regular if d(v)=k for
all v ∈ V
• A graph G is K-regular if d(v)=k for all v ∈
V

2-regular graph
 PATHS AND
CONNECTION
WALK – a walk in a graph G is an
alternating sequence
W: v0, e 1, v 1, e 2, v 2, …, vn-1 , e n , v n (n≥0) of
vertices and edges, beginning and ending
with vertices
• The length of a walk is the NUMBER of edges
it encounters
• A walk of length 0 is called a trivial walk
example :

WALK: v1-1-v2-3-v3-3-v2-5-v5
Special Kinds of Walks
• TRAIL
• a walk in which no edge is
repeated
• PATH
• A trail in which no vertex is
repeated
example :

TRAIL: v1-1-v2-5-v5-10-V6-9-V5
example :

PATH: v1-1-v2-5-v5-10-V6
Two vertices u and v of G are said to be
connected if there is a (u,v)- path in G.

Connected graph Disconnected graph

CYCLES
A cycle is a walk in which n≥3, v0 = vn and
the n vertices are distinct.
* v0, v 1, … , vn
A cycle of length n is referred to as an n-
cycle
A nontrivial closed trail is called a circuit
 EULER
GRAPHS
7 BRIDGES OF KONNIGSBERG

The Königsberg bridge problem was an

old puzzle concerning the possibility of
finding a path over every one of seven
bridges that span a forked river flowing
past an island— but without crossing any
bridge twice. Euler argued that no such
path exists.
 EULER TOURS
• A trail that traverses every edge of G is
called EULER TRAIL of G
• A tour of G is a closed walk that
traverses each edge of G at least once
• An EULER TOUR is a tour which
traverses each edge exactly once
• A graph is EULERIAN if it contains an
Euler tour
Theorem

• A nonempty connected graph is

Eulerian if and only if it has no
vertices of odd degree.
COROLLARY

• A connected graph has as Euler

trail if and only if it has at most
two vertices of odd degree
HAMILTONIAN
GRAPHS
4.2 HAMILTON CYCLES
• A path that contains every vertex of G is
called a Hamilton path of G.
(a graph path between two vertices of a
graph that visits each vertex exactly once)

• A Hamilton cycle(CIRCUIT) of G is a cycle

that contains every vertex of G
(cycle that visits each vertex exactly once).

• A graph is Hamiltonian if it contains a

Hamilton cycle.
Hamiltonian circuit. A directed graph in which the path begins and ends on the
same vertex (a closed loop) such that each vertex is visited exactly once