Math 006 Discrete Mathematics

Topic: Elements and Types of Graph

Graph Theory A graph with no loops is a multigraph.

- Branch of mathematics that deals with directed
and undirected graph.

A graph G consists of a set V of vertices and a

collection E of unordered pairs of vertices called
edges, denoted G = (V , E ) .

The order of a graph is the number of its vertices,

and its size is the number of its edges.
Two or more edges that join the same pair of
distinct vertices are called parallel edges.
A graph with at least one loop is a pseudograph.
An edge represented by an unordered pair in which
the two elements are not distinct is known as loop.
EXAMPLE:
e3
3
e1 e4
1 e5
e2 4 e8
2
e6
e9 e7
e10
5
6 7
e11 A simple graph is a graph with no parallel edges
and loops.
V(G) = {1, 2, 3, 4, 5, 6, 7}

E(G) = {e1, e2, e3, e4, e5, e6, e7, e8, e9, e10, e11}

Order: |𝐺| = 7

Size: ∥ 𝐺 ∥ = 11

Parallel Edges: e1 || e2, e4 || e5, e6 || e7, e10 || e11

Loop: e3 and e8

The complete graph K n is a graph with n vertices

in which there is exactly one edge joining every pair
of vertices.

The graph K1 with one vertex and no edge is known

as the trivial graph.
 If e = {u , v}  E (G) , vertices u and v are said to be
adjacent (to each other) and incident to e.

Ex. 2 and 3 are adjacent and incident to e1.

2 and 3 are adjacent and incident to e2.
3 and 4 are adjacent and incident to e4.
4 and 5 are adjacent and incident to e6.
6 and 7 are adjacent and incident to e10.

If each arc of a digraph is replaced by an edge, the

resulting structure is called the underlying graph
of the digraph.

A directed graph or digraph consists of a finite set

V of vertices and a set A of ordered pairs of distinct
vertices called arcs. If each edge of a simple graph is replaced by an
arc, the resulting structure is called the orientation
of the simple graph.
e3

e1 e4

e5
e2 e8
e6
e9
e7
e10

e11 Any orientation of a complete graph is known as

tournament.
arcs (DG):

arcs (UG):
The degree of a vertex in an undirected graph is A pendant vertex is a vertex whose degree is 1.
the number of edges incident with it, except that a
loop at a vertex contributes twice to the degree of An isolated vertex is a vertex whose degree is 0.
that vertex, denoted deg(v).

Ex.

Pendant Vertex: f

Isolated Vertex: g
deg(a) = 4 deg(e) = 3

deg(b) = 4 deg(f) = 1 Handshaking Theorem:

deg(c) = 2 deg(g) = 0 The graph G = (V, E), where V = {v1, v2, v3,...,vn}
and E = {e1, e2, e3,...,en}, satisfies ∑𝑛𝑖=1 𝑑(𝑣𝑖 ) = 𝑚.
deg(d) = 2 *m is the number of edges.

Ex. How many edges are there in a graph with 10

In a graph with directed edges (arcs), the in- vertices each of degree 6?
degree of vertex v, denoted by deg − (v) , is the
6(10) = 2m
number of edges with v as their terminal vertex.
60 = 2m
The out-degree of v. denoted by deg + (v) , is the 30 = m
number of edges with v as their initial vertex.

Ex.
Theorem 1:
a b
In a graph G, the sum of the degrees of all vertices
is twice the number of edges.
c
Corollary 1.1:
e d The sum of degrees of vertices of a graph is an
even number.
deg-(a) = 1 deg+(a) = 3 Corollary 1.2:
deg-(b) = 4 deg+(b) = 3 In a graph G, the number of odd degree is even.

deg-(c) = 0 deg+(c) = 2 Ex.

a b
deg-(d) = 5 deg+(d) = 3

deg-(e) = 4 deg+(e) = 4 e

c d
 deg(a) = 3 Properties of Walk, Trail, Path, Circuit and Cycle

deg(b) = 4 Terms Vertices Edges

Walk Repetition is allowed Repetition is
deg(c) = 4 allowed
Trail Repetition is allowed Repetition is not
deg(d) = 4 allowed
Path Repetition is not allowed Repetition is not
except possibly in initial allowed
deg(e) = 1
and terminal vertex ( a
walk from u-v or v-v)
no. of edges: 8 Circuit Repetition is allowed (a Repetition is not
trail from v-v) allowed
For theorem 1: Cycle Repetition is not allowed Repetition is not
Sum of the degrees of all vertices = 2(no. of edges) except the initial and allowed
3 + 4 + 4 + 4 + 1 = 2(8) terminal vertex ( a path
16 = 16 from v-v)
For Corollary 1.1:
Sum of degrees of vertices is even number A length of walk is the number of edges in a walk.
3 + 4 + 4 + 4 + 1 = 16 A cycle of length k is a cycle k - cycle
*16 is an even number
For Corollary 1.2: Example:
The no. of odd degree is even.
deg(a) = 3, deg(b) = deg(c) = deg(d) = 4, deg(e) =1
*Two vertices has an odd degree.

Theorem 2:

Let G be a simple graph with at least two vertices,

then G has at least 2 vertices of the same degree.
a - b - c - d - e - f is a walk of length 5 from vertex a
Ex to vertex f. the initial vertex of a walk is a and the
terminal vertex is f.
a b
a - b - c - d - e - f is an open walk (initial vertex is
not the same with terminal vertex)
e
a - b - c - g - a is a closed walk (initial vertex is the
d same with the terminal vertex)

vertices a and d; b and e have the same degree b - c - d - e - f - d - h is a trail since there is no
repeated edges. Note: a repeated vertex is
f g h permissible like the case of vertex d.

a - g - b - c - d - h - f is a path since there is no

repeated vertices and edges

i j k a - g - c - b - a is a circuit (a closed trail) since the

initial vertex is the same with the terminal vertex
vertices f, h, j and k have the same degree and there is no repeated edges.

a - b - c - g - a is a cycle (a closed path) since it

starts and ends with the same vertex and there is
no repeated vertices and edges.
Euler Circuit and Path b - c - d - b - e - f - g - e - d - f - c is an Eulerian path
since it covers all the egdes once and it does not
An Euler Circuit is a closed path that uses every start and end at the same vertex.
edge in the graph exactly once.
Hamiltonian Path and Circuit
Theorem: A connected graph is Eulerian if and
only if every vertex of the graph is of even degree. A Hamiltonian path is a path that visits each
vertex of the graph exactly once.
2

1 3
10 7
deg(a) = 2 deg(e) = 4

deg(b) = 4 deg(f ) = 4 11

deg(c) = 4 deg(g) = 2 9 8

deg(d) = 4
5 4
therefore a graph is eulerian since every vertex of
graph is of even degree.
1 - 5 - 10 - 2 - 7 - 4 - 9 - 11 - 8 - 3 - 6 is an
a - c - f - g - e - d - c - b - d - f - e - b - a is an hamiltonian path since it visits each vertex exactly
Eulerian circuit in graph. (it covers all the edges once. ( it is okay if it does not start and end at the
once) same vertex)
An Euler Path is a path that uses every edge in the
A Hamiltonian circuit is a path that uses each
graph exactly once but it does not start and end at
the same vertex. vertex of a graph exactly once and returns to the
starting vertex. A graph that contains a Hamiltonian
Theorem: A connected graph contains an Euler circuit
path if and only if the graph has exaclty two vertices
a
of odd degrees with all other vertices of even
degrees. Every Euler path must start at one of the
vertices of odd degrees and end at the other. h
g i
e f j b
q r

p s
o k
t

deg(b) = 3 deg(e) = 4 n l
m
deg(c) = 3 deg(f ) = 4
d c
deg(d) = 4 deg(g) = 2
a - b- c - d - e - f - o - n - m - l - k - j - i - r - s - t - p - q - g
*therefore a graph contains an eulerian path since it
has exactly two vertices of odd degree. - h - a is a hamiltonian circuit since it uses each vertex
exactly once and returns to the starting vertex.