COLLEGE OF BUSINESS EDUCATION 1

DEPARTIMENT OF MATHEMATICS
AND ICT
DISCRETE MATHEMATICS
MTT07101
PROGRAM: BIT -I
Introduction to Graph theory
Introduction to Graphs
2

Definition: A graph is collection of points called vertices &

collection of lines called edges each of which joins either a pair of
points or single points to itself.

Mathematically graph G is an ordered pair of (V, E)

A graph G is an ordered pair of a set V vertices and E , a set of edges

Each edge eij is associated with an ordered pair of vertices (Vi,Vj).

Introduction to Graphs
3
v1 e1
In Fig. G has graph 4 vertices namely e2
v2

v1, v2, v3, v4& 7 edges v4 e3

e5
e4
v3
Namely e1, e2, e3, e4, e5, e6, e7 Then e1=(v1, v2)
e7
e6
Similarly for other edges.
Graph G

In short, we can represent G=(V,E) where V=(v1, v2, v3, v4) &
E=(e1, e2, e3, e4, e5, e6,e7 )
Self Loops & Parallel Edges
4

Definition: If the end vertices Vi & Vj of any edge eij are same, then
edge eij called as Self Loop.

For Example, In graph G, the edge e6 =(v3, v3) is self loop.

Definition: If there are more than one edge is associated with given
pair of vertices then those edge called as Parallel or Multiple edge.

For Example, In graph G, e4 & e7 has (v3, v4) are called as Parallel
edge.
Simple & Multiple Graphs
5

Definition: A graph that has neither self loops

or parallel edge is called as Simple Graph
otherwise it is called as Multiple Graph.
For Example,

G1 (Simple Graph ) G2 (Multiple Graph)

Weighted Graph
6

Definition: If each edge or each vertex or both are associated with

some +ve no. then the graph is called as Weighted Graph

For Example, V1
1.4

V2

6
1.5

V4 V3

1.7
Finite & Infinite Graph
7

Definition: A graph is Finite no. of vertices as well as finite no. of

edges called as Finite Graph otherwise it is Infinite Graph.

For Example, The graph G1 & G2 is Finite Graph.

Definition: A graph G=(V,E) is called as Labeled Graph if its

edges are labeled with some names or data.

For Example, Graph G is labeled graph.

Adjacency & Incidence
8

Definition: Two vertices v1 & v2 vertices of G joins directly by at

least one edge then there vertices called Adjacent Vertices.

For Example, In Graph G, v1 & v2 are adjacent vertices.

Definition: If Vi is end vertex of edge eij=(vi,vj) then edge eij is said

to be Incident on vi. Similarly eij is said to be Incident on vj.

For Example, In Graph G, e1 is incident on v1 & v2.

Degree of a Vertex
9

Definition: The no. of edges incident on a vertex vi with self loop

counted twice is called as degree of vertex vi.

For Example, Consider the Graph G,

v1 e1
d(v1)=3 ,d(v2)=2 ,d(v3)=5 ,d(v4)= 4 e2
v2

v4 e3
e5
e4
v3
e7
Definition :
e6

A vertex with degree zero is called as Isolated Vertex & A vertex

with degree one is called as Pendant Vertex.
Matrix Representation of Graphs
10

A graph can also be represented by matrix.

Two ways are used for matrix representation of graph are given as
follows,

1.Adjacent Matrix

2.Incident Matrix

Lets see one by one…

1. Adjacent Matrix
11

The A.M. of Graph G with n vertices & no parallel edges is a

symmetric binary matrix A(G)=[aij] or order n*n where,

aij=1, if there is as edge between vi &vj.

aij=0, if vi & vj are not adjacent.

A self loop at vertex vi corresponds to aij=1.

For Example,

A(G)=
1. Adjacent Matrix
12

The A.M. of multigraph G with n vertices is

an n*n matrix A(G)=[aij] where,
aij=N, if there one or more edge are there
between vi &vj & N is no. of edges between vi
& vj .
aij=0, otherwise.
For Example,

A(G)=
2. Incident Matrix
13

Given a graph G with n vertices , e edges & no self loops. The

incidence matrix x(G)=[Xij] of the other graph G is an n*e matrix
where,

Xij=1, if jth edge ej is incident on ith vertex vi,

Xij=0, otherwise.

Here n vertices are rows & e edges are columns.

X(G)=
Directed Graph or Diagraph
14

Definition: If each edge of the graph G has a direction then graph

called as diagraph.

In a graph with directed edges, the in-degree of a vertex v, denoted

by deg-(v) & out-degree of v, denoted by deg+(v).

See the example in Next page….

Directed Graph or Diagraph
15
Example: What are the in-degrees and out-degrees of the vertices a,
b, c, d in this graph:

deg-(a) = 1 a
deg-(b) = 4
deg+(a) = 2 b deg+(b) = 2

deg-(d) = 2 d c
deg-(c) = 0
deg+(d) = 1 deg+(c) = 2
Adjacency Matrix of a diagraph
16

It is defined in similar fashion as it defined for undirected graph.

For Example,

A(D)=
Incident matrix of diagraph
17

Given a graph G with n, e & no self loops is matrix x(G)=[X ij] or

order n*e where n vertices are rows & e edges are columns such
that,Xij=1, if jth edge ej is incident out ith vertex vi

Xij=-1, if jth edge ej is incident into ith vertex vi

Xij=0, if jth edge ej not incident on ith vertex vi.

Null Graph
18

Definition: If the edge set of any graph with n vertices is an empty

set, then the graph is known as null graph.

It is denoted by Nn For Example,

N3 N4
Complete Graph
19

Definition: Let G be simple graph on n vertices. If the degree of

each vertex is (n-1) then the graph is called as complete graph.

Complete graph on n vertices, it is denoted by Kn.

In complete graph Kn, the number of edges are

n(n-1)/2,For example,

K1 K2 K3 K4 K5
Regular Graph
20

Definition: If the degree of each vertex is same say ‘r’ in any graph
G then the graph is said to be a regular graph of degree r.

For example,

K3 K4 K5
Isomorphism
21

Definition: Two graphs are thought of as equivalent (called

isomorphic) if they have identical behavior in terms of graph
theoretic properties.

Two graphs G(V, E) & G’(V’,E’) are said to be isomorphic to each

other if there is one-one correspondence between their vertices &
between their edges such that incidence relationship in preserved.

It is denoted by G1=G2
Isomorphism
22
For Example,
1 2 a b 1 a
2 b
3 d
4 3 d c 4 c

It is immediately apparent by definition of isomorphism that two

isomorphic graphs must have,

 the same number of vertices,

 the same number of edges, and
 the same degrees of vertices.
Sub Graph
23

Definition: A sub graph of a graph G = (V, E) is a graph G’ = (V’,

E’) where V’V and E’E.

Essentially , a sub graph is the graph within the larger graph

For Example:

G G1 G2
G1 and G2 are subgraph of G
Spanning Graph
24

Definition: Let G=(V, E) be any graph. Then G’ is said

to be the spanning subgraph of the graph G if its vertex
set V’ is equal to vertex set V of G.
Simply, we can say is the subgraph drawn by removing
few (or all) edges of G but retaining all vertices of G

For Example:

G G1 G2
Complement of a Graph
25

Definition: Let G is a simple graph. Then complement of G

denoted by ~G is graph whose vertex set is same as vertex set of G
& in which two vertices are adjacent if & only if they are not
adjacent in G.For Example:

G ~G H ~H
Operations on Graphs
26

Definition: The union of two simple graphs G1 =

(V1, E1) and G2 = (V2, E2) is the simple graph with vertex set V1  V2

and edge set E1  E2.

The union of G1 and G2 is denoted by G1  G2.

G1 G2 G1  G2
Operations on Graphs
27

Definition: The Intersection of two simple graphs G1 =(V1, E1) and

G2 = (V2, E2) is the simple graph with vertex set V1  V2 and edge set

E1  E2.

The Intersection of G1 and G2 is denoted by G1  G2.

G1 G2 G1  G2
THANKS: 2
8

KEEP READING

FINAL EXAM : WILL COVER

EVERY CONCEPT.