2

MATHEMATICAL FOUNDATIONS FOR

COMPUTING, PROBABILITY & STATISTICS
21MATCS41

Module – II : Introduction to Graph Theory

Definitions & Examples
Graph: A graph is a pair (V, E) where V is a non-empty set and E is a set
of unordered pairs of elements taken from the set V.
 For a graph (V, E) the elements of V are called vertices or points or
nodes and the elements of E are called edges or undirected edges. The
set V is called the vertex set and the set E is called the edge set.
 The graph (V, E) is also denoted by G = (V, E) or G = G (V, E) or G.
Null graph: A graph containing no edge is called a null graph.

Ex:
Here V = {a, b, c} and E = { }
Trivial graph: A null graph with only one vertex is called a trivial graph.
Ex:
Here V = {a} and E = { }
Finite graph: A graph with only a finite number of vertices and edges
is called a finite graph otherwise it is called an infinite graph.
Order and Size: The number of vertices in a graph is called the order of the
graph and the number of edges in it is called its size.
In other words, for a graph G = (V, E) the cardinality of the set V denoted by
|V|, is called the order of G and the cardinality of the set E denoted by |E|, is
called the size of G. A graph of order n and size m is called a (n, m) graph.

End Vertices: If vi and vj denote two vertices of a graph and if ek denotes the
edge joining vi and vj, then vi and vj are called the end vertices of ek .
Ex:
Here a and b are the end vertices of e1.

Loop: An edge whose end vertices are one and the same is known as a loop.
Ex:

Parallel edges: Two edges which have the same end vertices are known as
parallel edges. Ex:
Multiple edges: If in a graph, there are two or more edges with the same end
vertices, the edges are called multiple edges.

Ex:

Simple graph: A graph which does not contain loops and multiple edges is
called a simple graph. Ex:

Multi graph: A graph which contains multiple edges but no loops is called a
multi graph.
Ex:

General graph: A graph which contains multiple edges and / or loops is

called a general graph. Ex:
Incidence: When a vertex v of a graph G is an end vertex of an edge e in a
graph G, then the edge e is incident on or to the vertex v.
 Since every edge has two end vertices, every edge is incident on two
vertices, one at each end.
 The two end vertices are co-incident if the edge is a loop.

Adjacent vertices: Two vertices are said to be adjacent vertices or

neighbors if there is an edge joining them.

Adjacent edges: Two non-parallel edges are said to be adjacent edges if

they are incident on a common vertex i.e, if they have a vertex in common.

Ex:

In the above graph, A and B are adjacent vertices and e1, e2 are adjacent
edges.
Complete graph: A simple graph of order >= 2 in which there is an edge
between every pair of vertices is called a complete graph or a full graph. It
is denoted by Kn .
 Complete graph with two, three, four and five vertices are shown in
figures below:

 A Complete graph with five vertices is known as Kurtowiski’s first graph.

Bipartite graph: Suppose a simple graph G is such that its vertex set V is
the union of its mutually disjoint nonempty subsets V1 and V2 which are such
that each edge in G joins a vertex in V1 and a vertex in V2. Then G is called a
bipartite graph.
 If E is the edge set of this graph, the graph is denoted by G = (V 1, V2, E)
or G = G (V1, V2, E). The sets V1 and V2 are called bipartites or partitions
of the vertex set V.
For example, consider the graph G shown below for which the vertex set
V = {A, B, C, P, Q, R, S} and the edge set E = {AP, AQ, AR, BR, CS, CQ}.

 Note that V is the union of the subsets V1 = {A, B, C}, V2 = {P, Q, R, S}

which are such that V1, V2 are disjoint, every edge in G joins a vertex in
V1 to a vertex in V2.

 G contains no edge that joins two vertices both of which are in V1 or V2.
This graph is a bipartite graph with V1 = {A, B, C}, V2 = {P, Q, R, S} as
bipartites.
Complete Bipartite graph: A bipartite graph G = G (V1, V2, E) is called a
complete bipartite graph if there is an edge between every vertex in V1 and
every vertex in V2 .
The following figures show some complete bipartite graphs:

 Complete bipartite graph G = G (V1, V2, E) in which the bipartites V1, V2

contains r, s vertices respectively with r <= s is denoted by Kr, s.

 In this graph, each of r vertices in V1 is joined to each of s vertices in V2.

Thus Kr, s contains r+s vertices and rs edges i.e., the order is r+s and
size is rs. Therefore Kr, s is a (r+s, rs) graph.

 The graph K3, 3 is known as Kuratowski’s second graph.

Problems:
Q1: If G = G(V, E) is a simple graph, prove that 2 E  V 2  V
Solution: In a simple graph, there are no multiple edges.
Each edge of a graph is determined by a pair of vertices, i.e., for a pair of
vertices, we can have only one edge (2 vertices  1 edge) .
Hence for a simple graph with n >= 2, number of edges cannot exceed
number of pair of vertices.
i.e., m  nC2 ( number of pair of vertices that can be chosen from
n vertices is nC2 )
n!
m
(n  2) ! 2!

n (n  1) (n  2) ! n (n  1)
m  m
(n  2) ! 2 2

 2m  n 2  n

 2 E  V V
2
Q2: Show that a complete graph with n vertices, namely Kn has
1
n (n  1) edges.
2

Solution: In a complete graph, there exists exactly one edge between every
pair of vertices.
Therefore,
the number of edges in a complete graph = the number of pair of vertices.

i.e., m  nC2 ( number of pair of vertices that can be chosen from

n vertices is nC2 )
n!
 m
(n  2) ! 2!

n (n  1) (n  2) !
 m
(n  2) ! 2

n (n  1)
 m
2
1
Thus, in a complete graph with n vertices, no. of edges = m  n (n  1) .
2
Q3: Show that a simple graph of order 4 and size 7 and a complete
graph of order 4 and size 5 do not exist.
Solution:
(i) By data, order n = 4, size = m = 7
For a simple graph, 2m  n 2  n

 2  7  42  4

 14  12 ( which is false)
Thus, a simple graph of order 4 and size 7 does not exist.
(ii) By data, order n = 4, size = m = 5
1
For a complete graph, m  n (n  1)
2
1
 5  4 (4  1)
2
 5  6 ( which is false)

Thus, a complete graph of order 4 and size 5 does not exist.

Q4: (i) How many vertices and how many edges are there in the
complete bipartite graphs K4, 7 and K7, 11 ?
(ii) If the graph Kr, 12 has 72 edges, then what is r ?
Solution:
A complete bipartite graph Kr, s has r+s vertices and rs edges.

(i) The graph K4, 7 has 4+7 = 11 vertices and 4*7 = 28 edges
and the graph K7, 11 has 7+11 = 18 vertices and 7*11 = 77 edges.

(ii) Given that the graph Kr, 12 has 72 edges.

Consider m = rs
72 = r*12
This gives r = 6.
Q5: Show that a simple graph of order n = 4 and size m = 5 cannot be
a bipartite graph.

Solution:
For a bipartite graph, we have 4m  n 2    (1)

where order  V  n and size  E  m .

Given V  n  4 and E  m  5

Substituting in equation (1), we get

4  5  42
i.e., 20  16 which is false .
Thus a simple graph of order n = 4 and size m = 5 cannot be a
bipartite graph.
Remember:
 For a simple graph, 2m  n 2  n

1
 For a complete graph, m  n (n  1)
2

 For a bipartite graph, 4m  n 2

 For a complete bipartite graph Kr, s , there are r + s vertices and r*s
edges.
 MATHEMATICAL FOUNDATIONS FOR
COMPUTING, PROBABILITY & STATISTICS
21MATCS41

Module – II : Introduction to Graph Theory

Vertex Degree & Hand Shaking Property
Vertex Degree: Let G = G (V, E) be a graph and v be a vertex of G. Then
the number of edges of G that are incident on v with the loops counted
twice is called the degree of the vertex v and is denoted by deg (v) or d(v).
 The degrees of the vertices of a graph arranged in non – descending
order is called the degree sequence of the graph.
 The minimum of the degrees of vertices of a graph is called the degree
of the graph.

Ex: d (v1 )  3 , d (v2 )  4 , d (v3 )  4 , d (v4 )  3

Therefore the degree sequence of the graph is 3, 3, 4, 4 and the degree of

the graph is 3.
Isolated Vertex, Pendant Vertex & Pendant Edge:
A vertex is an isolated vertex if and only if its degree is zero.
A vertex of degree 1 is called a pendant vertex.
An edge incident on a pendent vertex is called a pendant edge.
Regular Graph: A graph in which all the vertices are of the same degree k
is called a regular graph of degree k or k – regular graph.

Ex:

The graphs shown in figure (a), (b) are 2 – regular, 4 – regular graphs
respectively. A 3 – regular graph is called a cubic graph. The graph shown in
figure (c) is a 3 – regular (cubic) graph. This particular cubic graph has 10
vertices and 15 edges, which is called the PETERSEN graph. The graph
shown in fig (d) is a cubic graph with 8 = 23 vertices. This particular graph is
called 3D hypercube and is denoted by Q3.

In general, for any positive integer k, a loop free k – regular graph with 2k
vertices is called the k – dimensional hypercube (or k – cube) and is
denoted by Qk .
Hand Shaking Property: The sum of the degrees of all vertices in a graph
is an even number and this number is equal to twice the number of edges
in the graph. i.e, for a graph G = (V, E),  deg(v)  2 E
vV

Proof: The above property is obvious from the fact that while counting the
degrees of vertices, each edge is counted twice(once at each end).

 This property is called the hand shaking property because it states that if
several people shake hands, then the total number of handshakes must be
even.

Theorem: In every graph, the number of vertices of odd degree is even.

Proof:
Consider a graph with ‘n’ vertices.
Suppose ‘k’ of these vertices are of odd degree, then the remaining n – k
vertices are of even degree.
Let us assume the ‘n’ vertices of the form: v1, v2, v3 ….vk, vk+1, vk+2…..vn .
Let v1, v2, v3 ….vk be the vertices of odd degree ----- (*)
and vk+1, vk+2…..vn be the vertices of even degree.
n k n
Then  deg(v )   deg(v )   deg(v )
i 1
i
i 1
i
i  k 1
i     (1)

In view of Hand Shaking Property(HSP), the sum on the LHS of equation (1)
is equal to twice the number of edges in the graph. And this sum is even.
The second term(sum) in the RHS of equation (1), is the sum of the degree
of vertices with even degree each. So, this sum is also even.
Thus the first term(sum) in the RHS of equation (1) must also be even.
i.e., deg(v1 )  deg(v2 )  deg(v3 )  .....  deg(vk )  EVEN     (2)
But from the assumption made(*), each of deg(v1), deg(v2),.....deg(vk) is odd.
Therefore, number of terms in the LHS of equation (2) must be even.
i.e., k is even.
(Since odd numbers added even number of times, the result is even)
Hence the proof.
Problems:
Q1: Can there be a graph with 12 vertices such that two of the vertices
have degree 3 each and the remaining 10 vertices have degree 4 each? If
so, find its size.
Solution:
Sum of the degree of the vertices  (2  3)  (10  4)
= 46 , which is even.
Hence there can be a graph of the desired type.

To find the size of such graph,

By HSP, Sum of the degree of the vertices = twice the number of edges
i.e., 46  2 E
 E  23
Therefore , the size of such graph is 23.
Q2: In a graph G = (V, E), what is the largest possible value for V
if E  19 and deg(v)  4 for all v  V ?
Solution:
Given: All the vertices are of degree > = 4
Therefore, Sum of the degrees of vertices > = 4n

 2 E  4n (since by HSP, Sum of the degree of the vertices

= Twice the number of edges)
 2 19  4n

 38  4n
38
 n  9.5  10
4
i.e., n  V  10

Thus the largest possible value of n = 9.

i.e., the given graph can have at most 9 vertices.
Q3: Show that there is no graph with 12 vertices and 28 edges in the
following cases:
(i) The degree of a vertex is either 3 or 4.
(ii) The degree of a vertex is either 3 or 6.
Solution: Suppose there is a graph with 28 edges and 12 vertices, of which
k vertices are of degree 3 (each).
(i) If all the remaining (12 – k) vertices have degree 4, then by HSP,
3k  4(12 – k )  2  28
 3k  48 – 4k  56
 k 8  k  8 ( # which is not possible)
(ii) If all the remaining (12 – k) vertices have degree 6, then by HSP,
3k  6(12 – k )  2  28
 3k  72 – 6k  56
16
  3k  16  k ( # which is not possible)
3
Thus, the graphs of the desired types cannot exist.
Q4: Show that there exists no simple graphs corresponding to the
following degree sequences:
(i) 0, 2, 2, 3, 4 (ii) 1, 1, 2, 3 (iii) 2, 3, 3, 4, 5, 6 (iv) 2, 2, 4, 6
Solution: (i) By HSP,  deg(v)  Even number
vV

 0  2  2  3  4  11  Even number
Thus no simple graph of degree sequence 0, 2, 2, 3, 4 exists.
(ii) By HSP, 1  1  2  3  7  Even number
Thus no simple graph of degree sequence 1, 1, 2, 3 exists.
(iii) By HSP, 2  3  3  4  5  6  23  Even number
Thus no simple graph of degree sequence 2, 3, 3, 4, 5, 6 exists.
(iii) By HSP, 2  2  4  6  14  Even number
But such a graph do not exist because with 4 vertices, we cannot draw a
simple graph having degrees 4 and 6.
Q5: (i) If a graph with ‘n’ vertices and ‘m’ edges is k – regular, show
kn
that m 
2
(ii) Does there exist a cubic graph with 15 vertices?
(iii) Does there exist a 4-regular graph with 15 edges?
Solution:
(i) Given that the graph G is k – regular.
 the degree of every vertex is k.
Therefore, If G has n vertices, then the sum of the degree of vertices is nk.
By HSP, this must be equal to 2m (if G has m edges)
kn
i.e., nk  2m  m
2
(ii) If there is a cubic graph(3-regular graph) with 15 vertices, then the
kn
number of edges it should have is m 
2
3 15 45
 m  (# since it is not an integer )
2 2
Thus a cubic graph with 15 vertices does not exist.
(iii) If there is a 4 – regular graph with 15 edges (i.e., k = 4, m = 15), then
the number of vertices it should have is
2 m  kn 
n  sin ce m  
k  2

2 15 30 (# since it is not an integer )

n 
4 4
Thus a 4 - regular graph with 15 edges does not exist.
Q6: Determine the order of the graph G = (V, E) in the following cases:
(i) G is a cubic graph with 9 edges.
(ii) G is regular with 15 edges.
(iii) G has 10 edges with 2 vertices of degree 4 and all others of degree 3.
Solution:
(i) Suppose the order of G is ‘n’.
Since G is a cubic graph, all vertices of G have degree 3.
Therefore, Sum of the degrees of the vertices = 3n.
By HSP,  deg(v)  2 E
vV

 3n  2  9 (Since G has 9 edges)

 n6
(ii) Given G is a regular graph, then all vertices of G must be of same
degree, say k.
Suppose the order of G is ‘n’.
Then, Sum of the degrees of the vertices = nk .
 By HSP,  deg( v)  2 E
vV

 nk  215 (Since G has 15 edges)

30
 n
k
Since ‘k’ is a positive integer, it follows that ‘n’ must be a divisor of 30.
i.e., n = 1, 2, 3, 5, 6, 10, 15, 30 (possible orders of G)

(iii) Suppose the order of G is ‘n’.

Given that, 2 vertices of G are of degree 4 and the remaining (n - 2) vertices
are of degree 3.
Then by HSP,  deg( v)  2 E
vV

 (2  4)  (n  2)  3  2 10 (Since G has 10 edges)

 3n  6  12

 3 n  18  n6
 2m
Q7: For a graph with ‘n’ vertices and ‘m’ edges, show that   
n
where  is the minimum and  is the maximum of the degree of the vertices.
Solution: Let d1, d2, d3,…..dn be the degrees of 1st, 2nd, …… nth vertex
respectively, then by HSP

 deg(v)  2 E
vV

 d1  d 2  d 3  .....  d n  2m     (1)

Given that  is the minimum of d1 , d 2 , d 3 ,....d n

i.e.,   d1 ,   d 2 ,   d 3 ,......   d n

       ......    d1  d 2  d 3  .......  d n (here  is added n times)

 n  2 m (from equation 1)
2m
        (2)
n
It is also given that  is the maximum of d1 , d 2 , d 3 ,....d n

i.e.,   d1 ,   d 2 ,   d 3 ,......   d n

       ......    d1  d 2  d 3  .......  d n (here  is added n times)

 n 2m (from equation 1)

2m
 
n
2m
i.e.,        (3)
n
Thus combining equations (2) and (3), we get
2m
  
n
 MATHEMATICAL FOUNDATIONS FOR
COMPUTING, PROBABILITY & STATISTICS
21MATCS41

Module – II : Introduction to Graph Theory

Isomorphism
Isomorphism:
Two graphs G and G are said to be isomorphic to each other if there is a
one to one correspondence between their vertices and between their edges
such that the adjacency of vertices is preserved. The adjacency of vertices
preserved means that for any two vertices u and v in G, if u and v are
adjacent in G then the corresponding vertices u , v in G are also adjacent
in G , then we write G  G .

From the definition of the isomorphism of the graphs, it follows that if two
graphs are isomorphic, then they must have
(1) The same number of vertices
(2) The same number of edges
(3) An equal number of vertices with a given degree.
These conditions are necessary but not sufficient.
This means that two graphs for which these conditions hold need not be
isomorphic. In particular two graphs of the same order and same degree need
not be isomorphic.
Problems:
Q1: Verify that the 2 graphs given below are isomorphic:

Solution: Let us rewrite the given graphs and name them as G1 and G2.
Also we shall name the vertices of the 2 graphs.

u1 u2 v1 v4

u3 u4 v3 v2
G1 G2

The 2 graphs G1 and G2 has 4 vertices and 4 edges each.

And the degree of all the vertices in G1 and G2 are equal to 2.
We observe that
u1  v1 u 2  v2 u3  v3 u 4  v4

This implies that, there is a 1 – 1 correspondence between the vertices of

G1 and G2.
Also
{u1 , u2 }  {v1 , v2 } {u1 , u3 }  {v1 , v3 }

{u2 , u4 }  {v2 , v4 } {u3 , u4 }  {v3 , v4 }

This implies that, there is a 1 – 1 correspondence between the edges of

G1 and G2.
Also adjacency of the vertices is preserved.

Thus G1  G2
Q2: Verify the 2 graphs given below are isomorphic:
A B A
P B
Q D P
S
C Q
R S
C
D
R
G1 G2
Solution: The 2 graphs G1 and G2 has 8 vertices and 12 edges each.
And the degree of all the vertices in G1 and G2 are equal to 3.
We observe that A  A , B  B , ......... R  R  , S  S .
This implies that, there is a 1 – 1 correspondence between the vertices of
G1 and G2.
Also {A , B}  {A , B}, {B , C}  {B , C}, ......... {R , S}  {R  , S}.
This implies that, there is a 1 – 1 correspondence between the edges of
G1 and G2.
Also adjacency of the vertices is preserved. Thus G1  G2
Q3: By labeling the graphs show that following graphs are isomorphic:
u1 u2 v1 v5
u7 v4
u3 v2
u6 u4 v7 v6
u5 v3
G1 G2
Solution: The 2 graphs G1 and G2 has 7 vertices and 14 edges each.
And the degree of all the vertices in G1 and G2 are equal to 4 each.
We observe that ui  vi  i  1, 2 .... 7
{ui , u j }  {vi , v j }  i  1, 2, ... 7 and j  1, 2, .... 7
This implies that, there is a 1 – 1 correspondence between the vertices of
G1 & G2 and there is a 1 – 1 correspondence between the edges of G1 & G2.
Also adjacency of the vertices is preserved.
 G1  G2
Q4: By labeling the graphs show that following graphs are isomorphic:
u1 v6

u6 v10 v1 v7
u10 u2 v2
u5 v5
u7
u9 u8 v4 v3

u4 u3 v9 v8
G1 G2
Solution: The 2 graphs G1 and G2 has 10 vertices and 15 edges each.
And the degree of all the vertices in G1 and G2 are equal to 3 each.
We observe that ui  vi  i  1, 2 ......10
{ui , u j }  {vi , v j }  i  1, 2, .....10 and j  1, 2, ....10
This implies that, there is a 1 – 1 correspondence between the vertices of
G1 & G2 and there is a 1 – 1 correspondence between the edges of G1 & G2.
Also adjacency of the vertices is preserved.
 G1  G2
Q5: Determine whether the following graphs are isomorphic or not.
u1 (2) v1 (3)
u5 (2) v5 (3)
u6 (3)
u4 (3) u8 (3) u2 (3) v4 (3) v8 (3) v2 (2)
v6 (2)

u7 (2) v7 (2)

G1 G2
u3 (2) v3 (2)
Solution:
(Let us write the degrees within brackets while naming the vertices)
The 2 graphs G1 and G2 has 8 vertices and 10 edges each.
We observe that, in G1, the vertex u1 of degree 2 is adjacent to vertices u2
and u4 whose degrees are 3 each.
Now suppose, the vertex u1 in G1 corresponds to v2 in G2(since both
are of same degree)
Then we observe that, in G2 , the vertex v2 of degree 2 is adjacent to vertex
v1 of degree 3 and vertex v3 of degree 2.
This implies that, the adjacency of vertices is not preserved.

Hence G1 is NOT ISOMORPHIC to G2.

Q6: Determine whether the following graphs are isomorphic or not.
u1 (3) u2 (4) v1 (3) v2 (4)

u5 (4)
v5 (4) v6 (4)
u6 (3)

u8 (3)
v8 (3) v7 (3)
u7 (4)

v4 (3) v3 (4)
u4 (4) u3 (3)
G1 G2
Solution:
(Let us write the degrees within brackets while naming the vertices)
The 2 graphs G1 and G2 has 8 vertices and 14 edges each.
We observe that, the vertex u1 of degree 3 in the graph G1 is adjacent to
vertices u2, u4, u5, all of which are of degrees 4 each.
Now suppose, the vertex u1 in G1 corresponds to v1 in G2(since both
are of same degree)
Then we observe that, in G2 , the vertex v1 is adjacent to v2, v4 and v5
whose degrees are 4, 3, 4 respectively.
This implies that, the adjacency of vertices is not preserved.

Hence G1 is NOT ISOMORPHIC to G2.

PRACTICE Questions:
Verify the following graphs are Isomorphic or not?

1.

2.
3.

4.
 MATHEMATICAL FOUNDATIONS FOR
COMPUTING, PROBABILITY & STATISTICS
21MATCS41

Module – II : Introduction to Graph Theory

Sub graphs and Complement of a graph
Sub graphs:
Given two graphs G, G1 ,we say that G1 is a sub graph of G if the
following conditions are satisfied:
(i) All the vertices and edges of G1 are in G.
(ii) Each edge of G1 has the same end vertices in G as in G1.

Spanning Sub graph:

A sub graph G1 of a graph G is a spanning sub graph of G whenever the
vertex set of G1 contains all the vertices of G.
Thus, a graph and all its spanning sub graphs have the same vertex set.

Ex:

For the graph shown in fig (a), the graph in fig (b) is a spanning sub graph
whereas the graph in fig (c) is a sub graph, but not a spanning sub graph.
Induced Sub graph:
Given a graph G = (V, E), if there is a sub graph G1 = (V1, E1) of G such that
every edge {A, B} of G is an edge of G1 also, where A, B  V1
Then G1 is called an induced sub graph of G (induced by V1) and is
denoted by V1

Ex:

For the graph shown in fig (a), the graph shown in fig (b) is an induced sub
graph, induced by the vertex set V1 = {v1, v2, v3, v4} whereas the graph
shown in fig (c) is not an induced sub graph since there is no edge between
v3 and v4.
Edge disjoint and Vertex disjoint Sub graphs:
Let G be a graph and G1 and G2 be two sub graphs of G then,
(i) G1 and G2 are said to be edge disjoint if they do not have any common
edge. (ii) G1 and G2 are said to be vertex disjoint if they do not have any
common edge and any common vertex.

Ex 1:

G G1 G2
For the graph G, the graphs G1 and G2 are vertex disjoint, as well as
edge disjoint sub graphs.

Ex 2:

G G1 G2
The graphs G1 and G2 are edge disjoint, but not vertex disjoint since A
and D are common vertices in G1 and G2.
Operations on Graphs
Consider two graphs G1 = (V1, E1) and G2 = (V2, E2). Then the graph whose
vertex set is V1  V2 and the edge set is E1  E 2 is called the union of G1 , G 2
and is denoted by G1  G2 .
Thus G1  G 2  V1  V2 , E1  E 2 
If V1  V2   then the graph whose vertex set is V1  V2 and the edge set is

E1  E 2 , is called the intersection of G1 , G2 and is denoted by G1  G2 .

Thus G1  G 2  V1  V2 , E1  E 2  if V1  V2  0
The graph whose vertex set is V1  V2 and the edge set is E1E 2 where E1E 2
is the symmetric difference of E1 , E2. (The symmetric difference E1E 2
denotes the set of all those elements (here edges) which are in E1 or E2 but
not in both) This graph is called the ring sum of G1, G2 and it is denoted by
G1G2 . Thus G1G 2  V1V2 , E1E 2 .
For the graphs shown in figures below, their union, intersection and the ring
sum is shown:

Decomposition: A graph G is decomposed or partitioned into two sub

graphs G1, G2 if G1  G2  G and G1  G2    Null graph

Deletion: If v is a vertex in a graph G, then G – v denotes the graph

obtained by deleting v and all the edges incident on v, from G.
This graph G – v, is referred as vertex deleted sub graph of G.
Deletion of a vertex always results in the deletion of all the edges incident
on that vertex. G – v is a sub graph of G induced by
V1  V  {v}.
If e is an edge in a graph G, then G – e denotes the sub graph of obtained by
deleting e (but not its end vertices) from G.
This sub graph is called edge – deleted sub graph of G.
The deletion of an edge does not alter the number of vertices. As such, an
edge deleted sub graph of a graph is a spanning sub graph of the graph.
For the graph G shown in fig (a), the sub graphs G – v and G – e are shown
in fig (b) and fig (c) respectively.
Complement of a Simple graph: Complement of a simple graph G is
the graph obtained by deleting those edges which are in G and adding the
edges which are not in G, usually denoted by G .
Note: 1) G and G have the same vertex set.
2) Two vertices are adjacent in G iff they are not adjacent in G .
3) Complement of a complete graph Kn is a null graph.
4) G  K n  G .

Ex:

G K4 G
Self Complementary graphs: A simple graph G which is isomorphic to its
complement is called a self complementary graph.

Ex:  GG

G G G G
Problems:
Q1: Let G be a simple graph of order ‘n’. If the number of edges in G is
56 and in G is 80 , then what is the value of n ?
Solution:
We have G  K n  G

 number of edges in G  number of edges in K n  number of edges in G

1
 80  n(n  1)  56
2
 (56  80)  2  n 2  n
 n 2  n  272  0
Solving, we get n = 17 , n = - 16.
But, n is the number of vertices in the given simple graph G, which cannot
be negative.
Thus order of G = n =17.
Q2: Find an example of a self complementary graph on 4 vertices and
one on 5 vertices.
Solution: We know that a simple graph G which is isomorphic to its
complement is called a self complementary graph.
Example on 4 vertices:

G G
Example on 5 vertices:

G G