CHAPTER - I

PRELIMINARIES

1.1 Definition:

A graph G consists of a pair ( V ( G ) , X ( G ) ) where V ( G ) is a non-empty finite set

whose elements are called points or vertices and X ( G ) is set of unordered pairs of distinct
elements of V ( G ). The elements of X ( G ) are called lines or edges of the graph G.

1.2 Definition:

If two vertices of a graph are joined by an edge then these vertices are called
adjacent vertices. If two or more edges of a graph have a common vertex then these edges
are called incident edges.

1.3 Definition:

A edge of a graph that joins a vertex to itself is called a loop. A loop is an edge
e=v i v i . If two vertices of a graph are joined by more than one edge then these edges are
called multiple edges. A graph which has neither loops nor parallel edges is called a simple
graph.

1.4 Definition

A graph in which any two distinct points are adjacent is called a complete graph.

1.5 Definition:

A graph G is called a bigraph or bipartite graph if V can be partitioned into two

disjoint subsets V1 and V2 such that every line of G joins a point of V1 to a point V2. (V1,V2)
is called a bipartition of G. If further G contains every line joining the points of V1to the
points of V2 then G is called a complete bigraph.

1
1.6 Definition:

Degree of a vertex v of any graph G is defined as the number of edges incident with
v. It is denoted by deg (v) or d(v).

1.7 Definition:

For any graph G, we defineδ ( G ) =min { deg v /v ϵ V (G) } and

∆ ( G ) =max { deg v /v ϵ V (G) }.If all the points of G have the same degree r then δ ( G ) =∆ ( G )=r
and this G is called a regular graph of degree r.

1.8 Definition:

A graph H=( V 1 , X 1 ) is called a subgraph of G= (V , X ) if V 1 ⊆V and X 1 ⊆ X . If H is

a subgraph of G we say that G is a supergraph of H. H is called a spanning subgraph of G
if V 1=V . H is called a induced subgraph of G if H is the maximal subgraph of G with point
set V 1. Thus, if H is an induced subgraph of G, two points are adjacent in H iff they are
adjacent in G.

1.9 Definition:

A walk of a graph G is an alternating sequence of points and lines

v 0 , x 1 , v 1 , x2 , v 2 , … , v n−1 , x n , v n beginning and ending with points such that each line x iis
incident with vi −1and vi . A walk is called a trail if all its lines are distinct and is called a path
if all points are distinct. A v 0−v n walk is called closed if v 0=v n . A closed walk
v 0 , v 1 , v 2 , … , v n=v 0 in which n ≥ 3 and v 0 , v 1 , v 2 , … , v n−1 are distinct of length n is called a
cycle. A cycle with n vertices is denoted as C n.

1.10 Definition:

Two points u and v of a graph G are said to be connected if there exist a u−v path in
G. A graph G is said to be connected if every pair of its points are connected.

2
1.11 Definition:

Denote, ⌈ n ⌉ – Largest integer greater than or equal to n.

⌊ n ⌋ – Smallest integer less than or equal to n.

1.12 Definition:

A graph that contains no cycles is called an acyclic graph. A connected acyclic graph
is called a tree.

1.13 Definition:

Star graph defn

1.14 Definition:

Bistar graph defn

1.15 Definition:

The wheel W n (n∈ N , n≥ 3) is a join of the graphs C n and K 1 .i.e. W n =Cn + K 1 .The
vertex corresponding to K 1is called as apex vertex. The vertices corresponding to C n are
called as rim vertices andC n is called rim of W n .

1.16 Definition:

The fan F n is the graph obtained by taking n concurrent chords in cycle C n+1. The
vertex at which all the chords are concurrent is called the apex vertex. It is also given by
F n=Pn + K 1.

1.17 Definition:

The double fan DFn is defined as Pn + 2K1.

3
1.18 Definition:

A gear graph Gn (n ≥ 3) is obtained from the wheel W n between adding a vertex

every pair of adjacent vertices of rim of W n .

1.19 Definition:

A web graph is the graph obtained by joining the pendant of a helm to form a cycle
and then adding a single pendant edge to each vertex of this outer cycle.
1.20 Definition:

A helm H n (n ≥ 3) is the graph obtained from the wheel W n by adding a pendant edge
at each vertex on the rim of W n .

1.21 Definition:

A crown C n ⊙ K 1 (n ∈ N , n ≥ 3) is obtained by joining a pendant edge to each vertex

ofC n.

1.22 Definition:

A chord of a cycle C n is an edge joining two non-adjacent vertices of cycle C n.

1.23 Definition:

The corona of G with H, G⊙ H is the graph obtained by taking one of G and p copies
of H and joining the ith vertex of G with an edge to every vertex in the ith copy of H.

1.24 Definition:

The triangular snake T nis obtained from the path Pnby replacing each edge of the
path by a triangle C 3.

1.25 Definition:

4
 The quadrilateral snakeQ nis obtained from the path Pn by replacing each edge of the
path by a cycle C 4.

1.26 Definition:

An alternate triangular snake A(T n ) is obtained from a path u1 u2 …u n by joining ui

andui +1(alternatively) to new vertex vi . That is every alternative edge of a path is replaced by
C3.

1.27 Definition:

A double triangular snake D Qn consists of two triangular snakes that have a

common path. That is a double triangular snake is obtained from a path u1 u2 …u nby joining
ui andui +1to a new vertex vi (1 ≤ i ≤ n – 1) and to a new vertex w i (1 ≤ i ≤ n – 1).

1.28 Definition:

A double quadrilateral snake D Qn consists of two triangular snakes that have a

common path.

1.29 Definition:

A double alternate triangular snake D A (T ¿¿ n)¿ consists of two alternate

triangular snakes that have a common path. That is, a double alternate triangular snake is
obtained from a pathu1 u2 …u n by joining ui andui +1 (alternatively) to two new vertices vi and
wi.

1.30 Definition:

A double alternate quadrilateral snake D A (Q¿¿ n)¿ consists of two alternate

quadrilateral snakes that have a common path. That is, it is obtained from a path u1 u2 …u n by
joining ui andui +1 (alternatively) to new vertices vi , x i and w i , y i respectively and adding the
edges vi w iand x i y i .

1.31 Definition:
5
 Labeling or valuation or numbering of a simple graphs G is an assignment of
integer to the vertices or edges or both subjects to certain condition.

1.32 Definition:

A binary vertex labeling of a graph G is called a cordial labeling if |v f ( 0 )−v f ( 1 )|≤1

and |e f ( 0 )−e f ( 1 )|≤1. A graph G is cordial if it admits cordial labeling.

1.33 Definition:

Let G be a ( p , q) graph. Let f be a map from V (G) to { 1,2 , … , p }. For each edgeuv ,

assign the label |f (u )−f (v )|. f is called difference cordial labeling if f is 1−1 and

|e f ( 0 )−e f ( 1 )|≤1 wheree f ( 1 ) and e f ( 0 ) denote the number of edges labeled and labeled with 0
respectively. A graph with a difference cordial labeling is called a difference cordial graph.

1.34 Definition:

Let G be a ( p , q) graph. Let k be an integer with 2 ≤ k ≤ p and f :V ( G)→ {1,2 , … , k }

be a map. For each edge uv, assign the label |f (u )−f (v )|. The function f is called a k-

difference cordial labeling of G if |v f ( 0 )−v f ( 1 )|≤1 and |e f ( 0 )−e f ( 1 )|≤1 where v f ( x ) denotes

the number of vertices labeled with x ( x ∈ { 1,2, … , k }), e f ( 1 ) and e f ( 0 ) respectively denote the
number of edges labeled with 1 and labeled with 0. A graph with a k-difference cordial
labeling is called a k-difference cordial graph.

6
 CHAPTER - II

DIFFERENCE CORDIAL LABELING OF GRAPHS

2.1 Definition:

Let G be a (p,q) graph. Let f be a map from V(G) to {1,2,3,…,p}. For each edge uv,
assign the label |f (u )−f (v )|. f is called difference cordial labeling if f is 1−1 and

|e f ( 0 )−e f ( 1 )|≤1 where e f ( 1 ) and e f ( 0 ) denote the number of edges labeled with 1 and labeled
with 0 respectively. A graph with a difference cordial labeling is called a difference cordial
graph.

The following is a simple example of a difference cordial graph.

Figure 2.1

2.2 Theorem:

Every graph is a subgraph of a connected difference cordial graph.

Proof:

Let G be a given (p,q) graph.

7
 p( p−1)
LetN= −2 p+2.
2

Consider the complete graph KP and the cycle CN.

Let V ( K p ) ={ u1 ,u2 , … , u p } and CN be the cycle v1 v 2 … v N v 1 .

We construct the super graph G ¿of G as follows:

¿
Let V ( G ) =V (K p )∪V (C N ) and E ( G ) =E(K p )∪ E (C N )∪ { u p v 1 }.
¿

Clearly G is a subgraph of G ¿.

Assign the label i to ui (1 ≤i ≤ p) and p+ j to v j (1 ≤ j≤ N) .

Therefore, e f ( 0 ) =N + p and e f ( 1 )=N + p−1.

Hence G ¿ is a difference cordial graph.

2.3 Theorem:

If G is a (p,q) difference cordial graph, then q ≤ 2 p−1 .

Proof:

Let f be a difference cordial labeling of G.

Obviously, e f ( 1 ) ≤ p−1.

This implies e f ( 0 ) ≥ q−p +1 …(1)

Case:(1)e f ( 0 ) =e f ( 1 )+ 1.

From (1),q ≤ e f ( 0 ) + p−1

¿ e f ( 1 ) +1+ p−1

≤ 2 p−1

8
Therefore,q ≤ 2 p−1 …(2)

Case: 2(i)e f ( 1 )=e f ( 0 )+ 1

From (1), q ≤ e f ( 0 ) + p−1

¿ e f ( 0 ) + p−1

≤ 2 p−2

Therefore,q ≤ 2 p−2 …(3)

Case: 2(ii)e f ( 1 )=e f ( 0 )+ 1

From (1), q ≤ e f ( 0 ) + p−1

¿ e f ( 1 )−1+ p−1

≤ 2 p−3

Therefore, q ≤ 2 p−2 …(4)

From (2), (3) and (4), q ≤ 2 p−1.

2.4 Theorem:

If G is a r-regular graph with r ≥ 4 then G is not difference cordial.

Proof:

Let G be a (p,q) graph.

Suppose G is difference cordial.

Then by theorem 2.3q ≤ 2 p−1.

4q
This implies q ≤ −1.
r

9
Hence q ≤ q−1.

This is impossible.

2.5 Theorem:

Any Path is difference cordial graph.

Proof:

Let Pnbe path u1 u2 …u n.

The following table 2.1 gives the difference cordial labeling of Pn , n≤ 8.

Table 2.1

Assume n< 8.

Define a map f :V ( P n) → {1 , 2 ,… , n } as follows:

Case: (1)n ≡ 0(mod 4 ).

10
Define,

n+ 2
f ( u i )=i 1 ≤ i≤
2

n+2 n
f u n+2 = + 2i1 ≤ i≤ −1
( 2
+i ) 2 4

n+2 n
f u3n = +2 i−11 ≤ i≤
( 4
+i ) 2 4

Case: (2)n ≡1(mod 4).

Define,

n+ 1
f ( u i )=i1 ≤ i≤
2

n+1 n−1
f u n+1 = +2 i1 ≤ i≤
( 2
+i ) 2 4

n+1 n−1
f u 3 n+1 = +2 i−1 1≤ i≤
( 4
+i ) 2 4

Case: (3)n ≡2(mod 4).

Define,

n+ 2
f ( u i )=i 1 ≤ i≤
2

n+2 n−2
f u n+2 = + 2i1 ≤ i≤
( 2
+i ) 2 4

n+2 n−2
f u 3 n+2 +2 i−1 1≤ i≤
( 4
+i )= 2 4

Case: (4)n ≡3 (mod 4 ).

11
Define,

n+ 1
f ( u i )=i1 ≤ i≤
2

n+1 n+1
f u n+1 = +2 i1 ≤ i≤ −1
( 2
+i ) 2 4

n+1 n+1
f u 3 n−1 = +2i−11 ≤i ≤
( 4
+i ) 2 4

The following table 2.2 proves that f is a difference cordial labeling.

Table 2.2

2.6 Corollary:

Any Cycle is a difference cordial graph.

Proof:

The function f in theorem 2.5 is also a difference cordial labeling of the cycle C :u1 u2 … un u 1.

2.7 Theorem:

The Star K 1 ,n is difference cordial iff n ≤ 5.

Proof:

12
Let V ( K 1 ,n ) ={ u , ui :1 ≤ i≤ n }, E ( K 1 , n) ={ u ui :1≤ i≤ n }.

Table 2.3 shows that the star K 1 ,n , n ≤5 is difference cordial.

Table 2.3

Assume n>5.

Suppose f is a difference cordial labeling of K 1 ,n , n>5.

Without loss of generality assume that f ( u )=x.

To get the edge label 1, the only possibility is that, f ( u i )=x−1 , f ( u j )=x +1 for some i,j.

This implies e f ( 0 ) −e f ( 1 ) ≥ n−2−2>1 , a contradiction.

2.8 Theorem:

K n is difference cordial iff n ≤ 4.

Proof:

Suppose K nis difference cordial.

n(n−1)
Then ≤2 n−1.
2

13
This implies n ≤ 4.

K 1 , K 2are difference cordial by theorem 2.5.

By corollary 2.6, K 3is difference cordial.

A difference cordial labeling of K 4 is given in figure 2.2.

Figure 2.2

Now we look into the complete bipartite graph K m , n .

2.9 Theorem:

If m ≥ 4 and n ≥ 4, then K m , nis not difference cordial.

Proof:

Suppose K m , nis difference cordial.

By theorem 2.3, mn ≤2 ( m+ n )−1.

This implies mn−2 m−2 n+1 ≤ 0, a contradiction to m ≥ 4 and n ≥ 4.

2.10 Theorem:

14
 K 2 , nis difference cordial iff n ≤ 4.

Proof:

Let V ( K 2 ,n ) =V 1 ∪ V 2where V 1= {u 1 , u2 } and V 2= { v i :1 ≤ i≤ n } .

K 1,2 , K 2,2 are difference cordial by theorem 2.5 and corollary 2.6 respectively.

A difference cordial labeling of K 2,3 and K 2,4 are given in figure 2.3.

Figure 2.3

Now, we assume n ≥ 5.

Suppose f is a difference cordial labeling.

Let f ( u 1 )=r 1 , f ( u2 ) =r 2 .

Then K 2 , n has at most 4 edges with label 1.

The maximum value is attained if the vertices in the set V 2receive the labels
r 1−1 , r 1 +1 ,r 2 −1, r 2 +1.

Therefore e f ( 1 ) ≤ 4 , e f ( 0 ) ≥2 n−4.

Hence e f ( 0 ) −e f ( 1 ) ≥ 2 n−8>2 , is contradiction.

15
2.11 Theorem:

K 3 , n is difference cordial iff n ≤ 4.

Proof:

K 3,1 , K 3,2 are difference cordial graphs by theorem 2.7 and theorem 2.10.

A difference cordial labeling of K 3,3 , K 3,4are given in figure 2.4.

Figure 2.4

For any injective map f on V ( K 3,5 ) , e f ( 1 ) ≤ 6.

Therefore, K 3,5 is not difference cordial.

Assume n ≥ 6.

Suppose K 3 , nis difference cordial, then by theorem 2.3, 3 n ≤ 2 ( n+3 )−1, a contradiction.

2.12 Theorem:

If m+n ≥ 9 then Bm , n is not difference cordial.

Proof:

LetV ( B m ,n ) ={ u , v , ui , v j :1≤ i≤ m ,1 ≤ j≤ n } and E ( Bm , n )={ u ui , v v j , uv :1 ≤ i≤ m, 1 ≤ j≤ n }.

16
Assume f ( u )=x and f ( v )= y .

Case: (i) y ≠ x−1 and y ≠ x +1.

To get the edge label 1, ui and u jmust receive the labels x−1 , x+1respectively for some i, j
and vi , v j must receive the labels y−1 , y +1 respectively for some i, j.

Hence e f ( 1 ) ≤ 4.

Case: (ii) y=x −1 or x +1.

Obviously, in this case e f ( 1 ) ≤3.

Thus, by case (i), (ii), e f ( 1 ) ≤ 4.

Therefore, e f ( 0 ) ≥ q−4 ≥ m+n−3.

Then e f ( 0 ) −e f ( 1 ) ≥ m+n−3−4 ≥ 2, a contradiction.

2.13 Theorem:

B1 ,n is difference cordial iff n ≤ 5.

Proof:

Let V ( B 1 ,n )= { u , v ,u 1 , v i :1≤ i≤ m } and E ( B1 ,n ) ={ u u1 , v v i , uv :1 ≤ j ≤n } .

Case: (1)n ≤ 5.

B1,1is difference cordial by theorem 2.4.

A difference cordial labeling of B1,2is in figure 2.5.

17
 Figure 2.5

For 3 ≤ n≤ 5 , Define,

f ( u )=2 , f ( v )=4 , f ( u 1) =1 , f ( v 1 ) =3 , f ( v i ) =3+i ,2 ≤i ≤ n .

Clearly this f is a difference cordial labeling.

Case: (2) n>5 .

When n ≥ 8, the result follows from theorem 2.12.

When n=6or 7, e f ( 1 ) ≤3.

Therefore, e f ( 1 ) ≤3

This is a contradiction.

2.14 Theorem:

B2 ,nis difference cordial iff n ≤ 6.

Proof:

Let V ( B 2 ,n ) ={ u , v ,u 1 , u2 , v i :1 ≤i ≤ n } and E ( B2 ,n ) ={u u1 ,u u2 v v i , uv :1 ≤i ≤n }.

18
Case: (1)n=2,3.

Whenn=2 ,define f ( u )=4 , f ( v )=2, f ( u 1) =6 , f ( u 2) =5 , f ( v 1) =1 , f ( v 2 ) =3.

When n=3 , define f ( u )=5 , f ( v ) =2, f ( u1 )=6 , f ( u 2 )=7 , f ( v 1 )=1 , f ( v 2) =3 , f ( v 3 )=4.

Clearly, f is a difference cordial labeling.

Case: (2)n=4,5,6 .

Define f ( v )=2 , f ( v1 ) =1 , f ( v i ) =1+ i, 2≤ i≤ n , f ( u 1) =n+2 , f ( u ) =n+3 , f ( u2 ) =n+ 4.

In this case, e f ( 0 ) =n−1 and e f ( 1 )=4.

Therefore, f is a difference cordial labeling.

Case: (3) n ≥ 7.

Proof follows from theorem 2.12.

2.15 Theorem:

B3 ,n is difference cordial iff n ≤ 5.

Proof:

Let and V ( B 3 ,n ) ={ u , v ,u i , v j :1 ≤ i≤ 3,1≤ j ≤ n } and E ( Bm , n )={ u ui , v v j , uv :1 ≤ i≤ 3,1≤ j ≤ n }.

B3,1 , B3,2are difference cordial graphs by theorems 2.13 and 2.14 respectively.

For 3 ≤ n≤ 5, define,
f ( v )=2 , f ( v1 ) =1 , f ( v i ) =1+ i, 2≤ i≤ n , f ( u 1) =n+2 , f ( u ) =n+3 , f ( u2 ) =n+ 4 , f ( u3 ) =n+5.

In this case, e f ( 0 ) =n and e f ( 1 )=4.

Therefore, f is a difference cordial labeling.

For n ≥ 6, the result follows from the theorem 2.12.

19
2.16 Remark:

B4,4 is difference cordial.

2.17 Theorem:

The wheel W n is difference cordial.

Proof:

Let W n =Cn + K 1 where C n is the cycle u1 u2 …u n u1and V ( K 1 )= {u }.

Define a map f :V ( W n)→ { 1,2, … , n+1 } by f ( u )=1 , f ( v i ) =i+1 , 1≤ i≤ n .

Then e f ( 0 ) =n and e f ( 1 )=n.

2.18 Theorem:

The fan F n is difference cordial for all n.

Proof:

Let F n=Pn + K 1where Pn is the path u1 u2 …u n and V ( K 1 )= {u }.

The function f given in theorem 2.17 is also a difference cordial labeling.

Sincee f ( 0 ) =n−1 and e f ( 1 )=n.

2.19 Theorem:

The gear graph G n is difference cordial.

Proof:

Let the vertex set and edge set of the wheel W n be defined as in theorem 2.17.

Let V ( Gn )=V (W n )∪ { v i :1 ≤i ≤ n } and E ( Gn ) =E ( W n ) ∪ { ui v i , v j u j+1 :1 ≤ i≤ n ,1 ≤ j≤ n }−E ( C n ).

20
Define f :V ( G n ) → {1,2 , … , 2 n+1 } as follows:

Case (i): n is even.

3 n+2
f ( u i )=2 i−11 ≤ i≤ if n ≡2(mod 4)
4

3n
1 ≤i ≤ if n ≡ 0(mod 4 )
4

3n n−2
f ( u n−i+1 )= +3+i1 ≤ i≤ if n ≡2(mod 4)
2 4

n
1 ≤i ≤ if n ≡ 0(mod 4 )
4

3 n−2
f ( v i )=2 i1 ≤ i≤ if n ≡2(mod 4)
4

3 n−4
1 ≤i ≤ if n ≡ 0(mod 4 )
4

3n n+ 2
f ( v n−i+1 ) = +i1 ≤ i≤ if n ≡2(mod 4)
2 4

n
1 ≤i ≤ if n ≡ 0(mod 4 )
4

Case (ii): n is odd.

3 n+1
f ( u i )=2 i−11 ≤ i≤ if n ≡1(mod 4)
4

3 n+3
1 ≤i ≤ if n ≡3 (mod 4 )
4

3 n−1 n−1
f ( u n−i+1 )= 2
{
3 n+1
2
+3+i ,1 ≤i ≤

+3+ i, 1≤ i≤
4
n−3
4
if n ≡1(mod 4)

if n ≡1(mod 4)

21
 3 n+1
f ( v i )=2 i 1 ≤ i≤ if n ≡1(mod 4)
4

3 n−1
1 ≤i ≤ if n ≡3 (mod 4 )
4

3 n+3 n−1
f ( v n−i+1 ) = +i−1 1 ≤i ≤ if n ≡2(mod 4)
2 4

n+1
1 ≤i ≤ if n ≡ 0(mod 4 )
4

Finally we define f ( u )=2 n+1.

Table 2.4 establishes that f is a difference cordial labeling.

Table 2.4

2.20 Theorem:

All webs are difference cordial.

Proof:
i i i i
Let C(i)
n be the cycle u1 u2 ….. un u1.

(i )
Let V ( W ( t , n ) ) =¿ i=1¿ t V ( Cn ) ∪ { u } ∪{ui :1 ≤ i≤ n }

And

E ( W ( t , n )) =¿ i=1 ¿ t E ( C (ni) ) ∪ {u u1j :1≤ i≤ n }∪ {unj v j : 1≤ j≤ n }∪ {u ij u i+1

j : 1≤ i≤ n ,1 ≤ i≤ t−1 } .

22
Define a map f :V ( W ( t ,n ) ) → { 1,2 ,… , nt +n+1 } as follows:

n
f ( ut2 i−1) =4 i−2 1≤ i ≤ if n is even
2

n+1
1 ≤i ≤ if n is odd
2

n
f ( ut2 i )=4 i−1 1≤ i ≤ if n is even
2

n−1
1 ≤i ≤ if n is odd
2

n
f ( v t2 i−1 )=4 i−3 1 ≤i ≤ if n is even
2

n+1
1 ≤i ≤ if n is odd
2

n
f ( v t2 i )=4 i 1≤ i ≤ if n is even
2

n−1
1 ≤i ≤ if n is odd
2

f ( ut− j
j )= ( j+1 )+ t+i 1≤ j ≤t−1 , 1≤ i≤ n−t .

f ( ut− j
n−i )= ( j+1 ) n+ j−i 1≤ j ≤ t−1, 1 ≤i ≤ j−1.

f ( u )=nt + n+1.

From, the following table 2.5 , f yields a difference cordial labeling of the webs W(t,n).

23
 Table 2.5

A web graph W(3,5) with a difference cordial labeling is given in figure 2.6.

Figure 2.6

2.21 Corollary:

The helm H n is difference cordial for all n.

24
Proof:

Since, H n ≅ W ( 1 ,n ) , the proof follows from theorem 2.20.

CHAPTER - III

DIFFERENCE CORDIAL LABELING OF SUBDIVISION OF

SNAKE GRAPHS

3.1 Theorem:

S(T n ) is difference cordial for all n>2.

Proof:

Let Pn be the path u1 u2 …u n .

Let V ( T n )=V ( Pn ) ∪ {vi :≤ i≤ n−1 }.

Let V ¿and E ¿.

Define an injective mapf :V ¿ by

f ( u i )=2 i−11 ≤ i≤ n

f ( wi ) =2i 1≤ i≤ n−1

f ( x i ) =2 n+ 2i−21 ≤i ≤n−1

25
f ( y i)=4 n−3+i 1≤ i≤ n−1

f ( v i )=2 n+2 i−1 1≤ i≤ n−1

Since e f ( 0 ) =e f ( 1 )=3 n−3, f is a difference cordial labeling of S ( T n ) .

3.2 Theorem:

S ( Qn ) is difference cordial.

Proof:

Let Pnbe the pathu1 u2 …u n .

Let V ( Qn )=V ( Pn ) ∪ { v i , w i :≤ i≤ n−1 } ∪V ( Pn ) .

Let V ¿ and E ¿

Define a by mapf :V ¿ by

f ( u i )=2 i−11 ≤ i≤ n

f ( u'i )=2i 1≤ i≤ n−1

f ( v i )=2 n+3 i−3 1 ≤i ≤ n−1

f ( z i ) =2 n+3 i−21 ≤i ≤ n−1

f ( wi ) =2 n+ 3i−11 ≤i ≤ n−1

f ( x i ) =5 n−4+i 1≤ i≤ n−1

f ( y i) =6 n−5+i1 ≤i ≤ n−1

Since, e f ( 0 ) =e f ( 1 )=4 n−4 f is a difference cordial labeling of S(Qn ).

3.3 Theorem:

26
 S( DT n ) is difference cordial.

Proof:
' '
Let V (S ( DT n ) )= {u i :1 ≤i ≤ n } ∪ {x i , y i , v i , x i , y i , wi , zi :1≤ i≤ n−1} and

E( S ( DT n) )=ui z i , z i ui+1 ,u i x i , y i ui+1 , xi v i , ui x 'i :1≤ i≤ n−1 }∪ {v i y i , w i y 'i , x'i w i , y 'i u i+1 :1 ≤ i≤ n−1 }

Define a by map f :V ( S ( DT n ))→{1 ,2 , … .,8 n−7 } by

f ( u i )=4 i−3 1≤ i ≤ n

f ( v i )=7 n−6+i 1≤ i≤ n−1

f ( x i ) =4 i=21 ≤i ≤n−1

f ( v i )=4 i−1 1≤ i≤ n−1

f ( y i) =4 i1 ≤i ≤n−1

f ( x'i ) =4 n+2 i−4 1 ≤ i≤ n−1

f ( wi ) =4 n+ 2i−3 1 ≤i ≤ n−1

f ( y 'i )=6 n−5+i 1≤ i ≤ n−1.

Obviously the above vertex labeling is a difference cordial labeling of S ( DT n ).

3.4 Theorem:

S ( DQ n) is difference cordial.

Proof:
' ' ' ' ' '
LetV (S ( DQ n ))=V ( DQn ) ∪ {ui , v i , wi , zi , xi , y i , z i :1 ≤ i≤ n−1 } and E ¿=

{u i u'i , ui x 'i , v 'i v i , x 'i x i , v i z 'i , x i zi , z 'i w i :1 ≤i ≤ n−1 } ∪ { z i y i , w i w'i , y i y 'i , w'i u i+1 , y 'i ui+1 :1≤ i≤ n−1 } .

27
Define a by map f :V ( S ( DQ n ) )→ {1 , 2, … .,12 n−11 } by

f ( u i )=6 i−5 1 ≤i ≤n

f ( u'i )=6 i−4 1 ≤ i≤ n−1

f ( v i )=6 i−31 ≤ i≤ n−1

f ( z'i ) =6 i−2 1≤ i≤ n−1

f ( wi ) =6 i−11 ≤ i≤ n−1

f ( w'i ) =6 i1 ≤ i ≤ n−1

f ( x'i ) =6 n+2 i−6 1 ≤i ≤ n−¿ 1

f ( x i ) =6 n+2 i−5 1≤ i≤ n−1

f ( z i ) =8 n+i−7 1 ≤i ≤n−1

f ( y i) =9 n+i−81 ≤ i≤ n−1

f ( y 'i )=10 n+i−9 1≤ i≤ n−1

'
f ( ui )=11 n+i−10 1≤ i≤ n−1.

Since, e f ( 0 ) =e f ( 1 )=7 n−7 f is a difference cordial labeling of S ( DQ n) .

3.5 Theorem:

S( A ( T n ) ) is difference cordial.

Proof:

Let the edges ui ui+1 , ui v i and vi ui+ 1 be subdivided by u'i , xi and y irespectively.

28
Case:(1) Let the triangle be start fromu1and ends with un.

7 n−2
In this case S( A ( T n ) ) consists of vertices and 4n – 2 edges.
2

7 n−2
Define a map f :V ( S (A (T n)))→ {1 ,2 , … , } by
2

f ( u i )=2 i−11 ≤ i≤ n

f ( u'i )=2i 1≤ i≤ n−1

n
f ( x i ) =2 n−1+i1 ≤ i≤
2

5 n−2 n
f ( y i) = +i1 ≤i ≤
2 2

n
f vn =3 n−1+i 1≤ i≤
( 2
−i+1 ) 2

Since, e f ( 0 ) =e f ( 1 )=2 n−1 , f is a difference cordial labeling of S( A ( T n ) ).

Case: (2) Let the triangle be start from u2and ends with un−1 .

7 n−8
In this case S( A ( T n ) ) has vertices and 4n – 6 edges.
2

Define a injective map f :V ( S (A (T n)))→ {1 ,2 , … .,7 n−8/2 } by

f ( u i )=2 i−2 1≤ i≤ n

f ( u'i )=2i−1 1≤ i≤ n−1

n−2
f ( x i ) =2 n−2+i1 ≤ i≤
2

5 n−6 n−2
f ( y i) = +i1 ≤ i≤
2 2

29
 n−2
f ( v i )=3 n−3+i 1≤ i≤
2

f ( u 1 )=3 n−3.

Obviously, f is a difference cordial labeling of S( A ( T n ) ).

Case: (3) Let the triangle be start from u1and ends withun .

7 n−5
In this case, the order and size of S( A ( T n ) ) has vertices and 4n – 4 edges.
2

The difference cordial labeling of S( A ( T 3 ) ) is given in figure 3.1.

Figure 3.1

Forn>3 ,Define a injective map f :V ( S (A (T n)))→ {1 ,2 , … .,7 n−8/2 } by

f ( u i )=2 i−11 ≤ i≤ n

f ( u'i )=2i 1≤ i≤ n−1

n−1
f ( x i ) =2 n−1+i1 ≤ i≤
2

5 n−3 n−1
f ( y i) = +i1 ≤i ≤
2 2

n−1
f ( v i )=3 n−2+i1 ≤ i≤
2

Since e f ( 0 ) =e f ( 1 )=2 n−2, f is a difference cordial labeling of S( A (T n )).

30
3.6 Theorem:

S( DA (T n )) is difference cordial.

Proof:

Let the edgesui ui+1 , ui v i , v i ui +1 , w i , w i ui +1 ,be subdivided by u'i , xi , y i , x 'i, y 'irespectively.

Case: (1) Let the triangles be start from u1and ends with un.

Here, the number of vertices and edges in S( DA (T n ))are 5n – 1 vertices and 6n – 2 edges
respectively.

Define a map f :V ( S (DA (T n))) →{1 ,2 , … .,5 n−1 } by

f ( u i )=2 i−11 ≤ i≤ n

f ( u'i )=2i 1≤ i≤ n−1

n
f ( x i ) =2 n−2+2 i1 ≤i ≤
2

n
f ( v i )=2 n−1+2i 1≤ i≤
2

n
f yn =3 n−1+i1 ≤i ≤
( 2
−i +1 ) 2

7 n−2 n
f ( x'i ) = +i1 ≤i ≤
2 2

n
f ( y 'i )=4 n−1+i1 ≤i ≤
2

9n−2 n
f ( wi ) = + i1 ≤i ≤
2 2

Since e f ( 0 ) =e f ( 1 )=3 n−1, f is a difference cordial labeling of S( DA (T n )).

31
Case: (2) Let the two triangles be start from u2and ends withun−1.

In this case, the order and size of S( DA (T n ))are 5n – 7 an d 6n – 10respectively.

Define a function f :V ( S (DA (T n)))→{1 ,2 , … .,5 n−7 } by f ( u 1 )=2 n−1 ,

f ( u i )=2 i−2 2≤ i≤ n

f ( u'i )=2i−1 1≤ i≤ n−1

n−2
f ( x i ) =2 n−2+2 i1 ≤i ≤
2

n−2
f ( v i )=2 n−1+2i 1≤ i≤
2

n−2
f ( y i) =4 n−5+ i1≤ i≤
2

n−2
f ( x'i ) =3 n+2 i−4 1≤ i≤
2

9 n−12 n−2
f ( y 'i )= +i 1≤ i≤
2 2

n−2
f ( wi ) =3 n+2i−31 ≤ i≤
2

Since e f ( 0 ) =e f ( 1 )=3 n−5, f is a difference cordial labeling of S( DA (T n )).

Case: (3) Let the triangles be start from u2and ends with un.

In this case, the order and size of S( DA (T n )) consist of 5n – 4 vertices and 6n – 6 edges
respectively.

Define a function f :V ( S (DA (T n))) →{1 ,2 , … .,5 n−4 } by

f ( u i )=2 i−11 ≤ i≤ n

32
f ( u'i )=2i 1≤ i≤ n−1

n−1
f ( x i ) =2 n+ 2i−21 ≤i ≤
2

n−1
f ( v i )=2 n+2 i−1 1≤ i≤
2

n−1
f ( x'i ) =3 n+2 i−3 1≤ i≤
2

n−1
f ( wi ) =3 n+2i−21 ≤i ≤
2

n−1
f ( y i) =4 n−3+ i1 ≤i ≤
2

9 n−7 n−1
f ( y 'i )= + i1 ≤i ≤
2 2

Since e f ( 0 ) =e f ( 1 )=3 n−3, f is a difference cordial labeling of S( DA (T n )).

3.7 Theorem:

S ( A Qn )is difference cordial.

Proof:

Let the edges ui ui+1 , ui v i , v i w i , w i ui +1be subdivided by u'i , v 'i , z i , w'irespectively.

Case: (1) Let the squares be starts fromu1and ends with un .

9 n−2
In this case the order and size of S ( A Q n ) are and 5n – 2 respectively.
2

9 n−2
Define a map f :V ( S (A Q n))→ {1 , 2 ,… , } by
2

f ( u i )=2 i−11 ≤ i≤ n

33
f ( u'i )=2i 1≤ i≤ n−1

n
f ( v 'i ) =2 n+2i−21 ≤i ≤
2

n
f ( v i )=2 n+2 i−1 1≤ i≤
2

n
f ( w'i ) =3 n−1+ i1 ≤i ≤
2

n
f wn =4 n−1+i 1≤ i≤
( 2
−i+ 1 ) 2

5 n−2
Sincee f ( 0 ) =e f ( 1 )= , f is a difference cordial labeling of S ( A Qn ).
2

Case: (2) Let the squares be starts from u2and ends withun−1.

The difference cordial labeling of S ( A Q4 ) is given in figure 3.2.

Figure 3.2

9 n−12
For n> 4 ,Define a map f :V ( S (A Q n))→ {1 , 2 ,… , } by
2

f ( u i )=2 i−2 2≤ i≤ n

f ( u'i )=2i−1 1≤ i≤ n−1

34
 n−2
f ( v 'i ) =2 n+2i−31 ≤ i≤
2

n−2
f ( v i )=2 n+2 i−2 1≤ i≤
2

n−2
f ( w'i ) =3 n−4+ i1 ≤i ≤
2

7 n−10 n−2
f ( zi )= +i1 ≤i ≤
2 2

n−2
f ( wi ) =4 n−6+i 1≤ i≤
2

9 n−12
and f ( u 1 )=
2

Since e f ( 0 ) =e f ( 1 )=5 n−8, f is a difference cordial labeling of S( A Q n ).

Case: (3) Let the squares be start from u2and ends with un.

The difference cordial labeling of S( A Q n ) is given in figure 3.3.

Figure 3.3

9 n−7
For n>3 ,Define a map f :V ( S ( A Q n ) )→{1, 2 , … , } by
2

f ( u i )=2 i−1 2≤ i≤ n

35
f ( u'i )=2i 1≤ i≤ n−1

n−1
f ( v 'i ) =2 n+2i−21 ≤i ≤
2

n−1
f ( v i )=2 n+2 i−1 1≤ i≤
2

n−1
f ( z i ) =3 n−2+i 1≤ i≤
2

7 n−5 n−1
f ( wi ) = +i 1 ≤i ≤
2 2

n−1
f ( w'i ) =4 n−3+ i1 ≤i ≤
2

5 n−5
Since e f ( 0 ) =e f ( 1 )= , f is a difference cordial labeling of S ( A Q n ).
2

3.8 Illustration:

The difference cordial labeling of DA ( Q8 ) is given in figure 3.4.

Figure 3.4

The difference cordial labeling of DA ( Q8 ) is given in figure 3.5.

36
 Figure 3.5

The difference cordial labeling of DA ( Q7 ) is given in figure 3.6.

Figure 3.6

3.9 Theorem:

S ( DA Qn ) is difference cordial.

Proof:

Let the edges ui ui+1 , ui v i , v i w i , w i ui +1 ,ui x i , x i y i , y i ui +1be subdivided by u'i , v 'i , z i , w'i , x'i , z'i , y i
respectively.

Case:(1) Let the squares be start fromu1and ends with un.

The order and size of S ( DA Qn ) are 7n – 1 and 8n – 2 respectively.

Define a map f :V ( S ( DA Q n ) ) →{1 , 2 , ….,7 n−1 } by

f ( u i )=2 i−11 ≤ i≤ n

f ( u'i )=2i 1≤ i≤ n−1

37
 n
f ( v i )=2 n+3 i−3 1 ≤i ≤
2

n
f ( z i ) =2 n+3 i−21 ≤i ≤
2

n
f ( wi ) =2 n+ 3i−11 ≤i ≤
2

7 n−6 n
f ( xi )= +3 i1 ≤i ≤
2 2

7 n−4 n
f ( z'i ) = +3 i1 ≤i ≤
2 2

7 n−2 n
f ( y i) = +3 i1 ≤i ≤
2 2

11n−2 n
f ( x'i ) = +i1 ≤i ≤
2 2

13 n−2 n
f ( w'i ) = +i1 ≤i ≤
2 2

n
f y 'n
( 2
−i+1 )=5 n−1+i1 ≤ i≤ 2
n
f ( v 'i ) =6 n−1+i 1≤ i ≤
2

Since e f ( 0 ) =e f ( 1 )=4 n−1 , f is a difference cordial labeling of S ( DA Qn ).

Case:(2) Let the squares be start from u2and ends with un−1.

The order and size of S ( DA Qn ) are 7n – 11 and 8n – 14 respectively.

Define a map f :V ( S ( DA Q n ) ) →{1 , 2 , ….,7 n−11 } by

f ( u i )=2 i−2 2≤ i≤ n

38
f ( u'i )=2i−1 1≤ i≤ n−1

n−2
f ( v i )=2 n+3 i−4 1 ≤i ≤
2

n−2
f ( z i ) =2 n+3 i−31 ≤ i ≤
2

n−2
f ( wi ) =2 n+ 3i−21 ≤i ≤
2

7 n−14 n−2
f ( xi )= +3 i1 ≤i ≤
2 2

7 n−12 n−2
f ( z'i ) = +3 i1 ≤i ≤
2 2

7 n−10 n−2
f ( y i) = +3 i1 ≤i ≤
2 2

11 n−18 n−2
f ( w'i ) = +i1 ≤ i≤
2 2

13 n−22 n−2
f ( y 'i )= +i1 ≤ i≤
2 2

n−2
f ( v 'i ) =5 n−8+ i1 ≤i ≤
2

n−2
f ( x'i ) =6 n−10+i1 ≤ i≤
2

and f ( u 1 )=7 n−11.

Sincee f ( 0 ) =e f ( 1 )=4 n−7 , f is a difference cordial labeling of S ( DA Q n ).

Case:(3) Let the squares be start from u2and ends with un.

n−1
Assign the labels to the verticesui (1 ≤i ≤ n),u'i (1 ≤i ≤ n−1), vi , z i , w i (1≤ i≤ ) as in case 1.
2

39
 7 n−9 n−1
f ( xi )= +3 i1 ≤i ≤
2 2

7 n−7 n−1
f ( z'i ) = +3 i1 ≤ i≤
2 2

7 n−5 n−1
f ( y i) = +3 i1 ≤i ≤
2 2

11 n−9 n−1
f ( w'i ) = +i 1≤ i≤
2 2

13 n−11 n−1
f ( y 'i )= +i 1≤ i≤
2 2

n−1
f ( v 'i ) =5 n−4+i 1≤ i≤
2

n−1
f ( x'i ) =6 n−5+i1 ≤ i≤
2

Since e f ( 0 ) =e f ( 1 )=4 n−4 , f is a difference cordial labeling of S ( DA Qn ).

CHAPTER - IV

DIFFERENCE CORDIAL LABELING OF GRAPHS

OBTAINED FROM DOUBLE SNAKES

4.1 Definition:

40
Let G be a (p,q) graph. Let f be a map from V(G) to { 1,2 , … , p }. For each edge uv, assign

the label |f (u )−f (v )|. f is called difference cordial labeling if f is 1−1and |e f (0)−e f ( 1)|≤ 1

wheree f ( 1 ) ande f (0) denote the number of edges labeled with 1 and not labeled with 1
respectively. A graph with a difference cordial labeling is called a difference cordial
labeling.

A double triangular snake DT n consists of two triangular snakes that have a common path.
That is, a double triangular snake is obtained from a path u1,u2,…,un by joining ui and ui +1to a
new vertex vi ( 1≤ i≤ n−1 ) and to a new vertex w i ( 1 ≤i ≤ n−1 ).

4.2 Theorem:

DT n ⊙k 1is difference cordial.

Proof:

Let V ( DT n ⊙ k 1 )=V ( DT n ) ∪ { x i :1 ≤ i≤ n } ∪ { v 'i , w 'i :1 ≤i ≤n } and

E ( DT n ⊙k 1 ) =E ( DT n ) ∪ { ui x i :1≤ i≤ n } ∪ { v i v 'i , w i w'i :1 ≤ i≤ n−1 }.

Define f :V ( DT n ⊙k 1 ) → {1,2 , … 6 n−4 } by

f ( u i )=4 i−2 1≤ i≤ n

f ( x i ) =4 i−31 ≤i ≤ n

f ( v i )=4 i−1 1≤ i≤ n−1

f ( v 'i ) =4 i 1≤ i≤ n−1

f ( wi ) =4 n+ 2i−3 1 ≤i ≤ n−1

f ( w'i ) =4 n+2 i−21 ≤ i≤ n−1

Since e f ( 1 )=4 n−3 and e f ( 0 ) =4 n−4 , DT n ⊙ k 1 is difference cordial.

41
4.3 Theorem

DT n ⊙2 k 1is difference cordial.

Proof:

Let V ( DT n ⊙ 2k 1) =V ( DT n ) ∪ { x i , y i :1 ≤ i≤ n } ∪ { v 'i , v 'i ' , w 'i , w'i ' :1≤ i≤ n−1 } and

E ( DT n ⊙2 k 1 )=E ( DT n ) ∪ { ui x i , ui y i :1 ≤i ≤ n } ∪ {v i v 'i , v i v 'i ' , wi w 'i , w i w'i ' :1 ≤i≤ n−1 }.

Define f :V ( DT n ⊙2 k 1 ) → { 1,2 , … 9 n−6 } by

f ( u i )=6 i−4 1 ≤i ≤n

f ( x i ) =6 i−5 1≤ i≤ n

f ( y i) =6 i−3 1 ≤i ≤n

f ( v i )=6 i−11 ≤i ≤n−1

f ( v 'i ) =6 i−2 1≤ i≤ n−1

f ( v 'i ' ) =6 i 1≤ i≤ n−1

n−2
f ( wi ) =6 n+3 i−4 1≤ i≤ ⌊ ⌋
2

n−2
f ( w'i ) =6 n+3 i−5 1 ≤i ≤ ⌊ ⌋
2

n−2
f ( w'i ' )=6 n+3 i−3 1≤ i≤ ⌊ ⌋
2

n−2 n+ 2
f ( wi ) =6 n+3 ⌊ ⌋ +3 i−5 1≤ i≤ ⌈ ⌉
2 2

n−2 n+2
f w' =6 n+ 3 ⌊ ⌋+ 3i−4 1 ≤i ≤ ⌈ ⌉
( ⌊
n−2
2
⌋+ i ) 2 2

42
 n−2 n+2
f w' ' n−2 =6 n+ 3 ⌊ ⌋+ 3i−31 ≤ i≤ ⌈ ⌉
( ⌊
2
⌋+ i ) 2 2

The following table 4.1 proves that f is a difference cordial labeling of DT n ⊙2 k 1.

Table 4.1

4.4 Theorem:

DT n ⊙k 2is difference cordial.

Proof:

Let V ( DT n ⊙ k 2 )=V ( DT n ) ∪ { x i , y i : 1≤ i≤ n } ∪ { v 'i , v 'i' , w'i , w'i ' :1 ≤i ≤ n−1 } and

E ( DT n ⊙k 2 ) =E ( DT n ) ∪ { ui x i ,u i y i , x i y i :1 ≤i ≤ n } ∪ {v i v 'i , v i v 'i ' , wi w 'i , w i w'i ' :1 ≤i≤ n−1 }.

Define f :V ( DT n ⊙k 2 ) → {1,2 , … 9 n−6 } by

f ( u i )=6 i−3 1 ≤i ≤ n−1

f ( x i ) =6 i−4 1 ≤ i≤ n−1

f ( y i) =6 i−5 1 ≤i≤ n−1

f ( v i )=6 i−21 ≤i ≤ n−1

f ( v 'i ) =6 i1 ≤i ≤n−1

43
f ( v 'i ' ) =6 i−1 1 ≤i≤ n−1

f ( wi ) =6 n+3 i−5 1≤ i≤ n−1

f ( w'i ) =6 n+3 i−4 1 ≤i ≤n−1

f ( w'i ' )=6 n+3 i−3 1≤ i≤ n−1

f (un )=6 n−5 , f (x ¿¿ n)=6 n−4 ¿ and f ( y n )=6 n−3.

Sincee f ( 1 )=7 n−5 and e f ( 0 ) =7 n−6 ,f is a difference cordial labeling of DT n ⊙k 2.

4.5 Theorem:

DQ n ⊙k 1is difference cordial.

Proof:

Let V ( DQn ⊙k 1 ) =V ( DQn ) ∪ {u'i :1 ≤i≤ n }∪ {v 'i , w'i , x'i , y 'i :1 ≤i ≤ n−1 } and

E ( DQ n ⊙ k 1) =E ( DQ n ) ∪ {ui u 'i :1 ≤i ≤n } ∪ {v i v 'i , wi w 'i , x i x 'i , y i y 'i :1 ≤i ≤ n−1 }.

Define a map f :V ( DQ n ⊙ k 1 ) → { 1,2 ,… 10 n−8 } by

f ( u i )=4 n+2 i−5 1≤ i≤ n

f ( u'i )=4 n+ 2i−4 1 ≤i ≤n

f ( v i )=4 i−2 1≤ i≤ n−1

f ( v 'i ) =4 i−31 ≤ i ≤ n−1

f ( wi ) =4 i−1 1 ≤i ≤n−1

f ( w'i ) =4 i1 ≤i ≤n−1

f ( x i ) =6 n+ 4 i−7 1≤ i≤ n−1

44
f ( x'i ) =6 n+ 4 i−6 1 ≤i ≤ n−1

f ( y i) =6 n+ 4 i−5 1 ≤i≤ n−1

f ( y 'i )=6 n+4 i−4 1 ≤i ≤ n−1

Sincee f ( 1 )=6 n−5 and e f ( 0 ) =6 n−6 ,f is a difference cordial labeling of DQ n ⊙ k 1 .

4.6 Theorem:

DQ n ⊙ 2 k 1is difference cordial.

Proof:

Let

V ( DQn ⊙2 k 1 )=V ( DQ n ) ∪ {v 'i , v 'i ' , w 'i , w 'i' , x 'i , x'i ' , y 'i , y'i ' :1 ≤ i≤ n−1 } ∪ {v 'i , w'i , x 'i , y 'i :1 ≤i ≤n−1 } , E ( DQn ⊙2 k 1 )=
.

Define a map f :V ( DQ n ⊙ 2 k 1 ) → {1,2 , … 15 n−12 } by

f ( u i )=9 i−7 1 ≤i ≤ n

f ( u'i )=9 i−8 1≤ i≤ n

''
f ( ui ) =9 i−6 1 ≤i ≤ n

f ( v i )=9i−4 1 ≤i ≤ n−1

f ( v 'i ) =9 i−5 1≤ i≤ n−1

f ( v 'i ' ) =9 i−3 1 ≤i ≤ n−1

f ( wi ) =9 i−11 ≤ i≤ n−1

f ( w'i ) =9 i−2 1≤ i≤ n−1

45
f ( w'i ' )=9i 1≤ i≤ n−1

n
f ( x i ) =9 n+6 i−10 1 ≤i ≤ ⌊ ⌋
4

n
f ( x'i ) =9 n+ 6i−111≤ i≤ ⌊ ⌋
4

n
f ( x'i ' )=9 n+6 i−9 1 ≤i ≤ ⌊ ⌋
4

n 3n
f x =9 n+6 ⌊ ⌋ +6 i−11 1 ≤i ≤ ⌈ ⌉−1
( n
⌊ ⌋ +i
4 ) 4 4

3n
f x' =9 n+6 ⌊ n/ 4 ⌋ +6 i−10 1≤ i≤ ⌈ ⌉ −1
( n
⌊ ⌋ +i
4
) 4

3n
f x' ' n =9 n+6 ⌊ n/ 4 ⌋ +6 i−9 1≤ i≤ ⌈ ⌉−1
( ⌊ ⌋ +i
4
) 4

n−4 if n≡ 0,1 ( mod 4 ) 1 ≤ i≤ ⌊ n−4 ⌋

f ( y i) =9 n+6 i−7 1 ≤ i≤ ⌊ ⌋ 4
4
if n ≡2,3 ( mod 4 )

' n−4 if n ≡0,1 ( mod 4 ) 1≤ i≤ ⌊ n−4 ⌋

f ( y )=9 n+6 i−8 1≤ i≤ ⌊
i ⌋ 4
4
if n≡ 2,3 ( mod 4 )

n−4 if n≡ 0,1 ( mod 4 ) 1 ≤i ≤ ⌊ n−4 ⌋

f ( y 'i' ) =9 n+6 i−6 1 ≤i ≤ ⌊ ⌋ 4
4
if n ≡2,3 mod 4
( )

Case:(i)n ≡ 0,1 ( mod 4 ) .

n−4 3n
f y =9 n+6 ⌊ ⌋ +6 i−81 ≤ i≤ ⌈ ⌉
( ⌊
n−4
4
⌋ +i ) 4 4

n−4 3n
f y ' n−4 =9 n+ 6 ⌊ ⌋+ 6 i−7 1≤ i≤ ⌈ ⌉
( ⌊
4
⌋+i ) 4 4

46
 n−4 3n
f y '' n−4 =9 n+ 6 ⌊ ⌋+ 6 i−6 1≤ i≤ ⌈ ⌉.
( ⌊
4
⌋+i ) 4 4

Case:(ii)n ≡2,3 ( mod 4 ) .

n−4 3n
f y =9 n+6 ⌊ ⌋ +6 i−81 ≤ i≤ ⌊ ⌋
( ⌊
n−4
4
⌋ +i ) 4 4

n−4 3n
f y ' n−4 =9 n+ 6 ⌊ ⌋+ 6 i−7 1≤ i≤ ⌊ ⌋
( ⌊
4
⌋+i ) 4 4

n−4 3n
f y '' n−4 =9 n+ 6 ⌊ ⌋+ 6 i−6 1≤ i≤ ⌊ ⌋.
( ⌊
4
⌋+i ) 4 4

The following table 4.2 proves that f is a difference cordial labeling of DQ n ⊙ 2 k 1.

Table 4.2

4.7 Theorem:

DQ n ⊙ k 2is difference cordial.

Proof:

Let

V ( DQn ⊙k 2 ) =V ( DQn ) ∪ { v 'i , v'i ' , w'i , w'i ' , x 'i , x 'i' , y 'i , y 'i ' : 1≤ i≤ n−1 } ∪ {u'i , u'i' :1≤ i≤ n } , E ( DQ n ⊙k 2 )=E ( DQ n ) ∪ {
.

Define a map f :V ( DQ n ⊙ 2 ) → { 1,2, … 15 n−12 } by

47
f ( u i )=6 n+ 3i−81 ≤ i≤ n

f ( u'i )=6 n+3 i−7 1≤ i≤ n

f ( u'i ' ) =6 n+3 i−6 1 ≤i ≤ n

f ( v i )=6 i−31 ≤ i≤ n−1

f ( v 'i ) =6 i−4 1≤ i≤ n−1

f ( v 'i ' ) =6 i−5 1 ≤i ≤ n−1

f ( wi ) =6 i−21 ≤ i≤ n−1

f ( w'i ) =6 i1 ≤ i≤ n−1

f ( w'i ' )=6i−11 ≤i ≤ n−1

f ( x i ) =9 n+6 i−111 ≤i ≤ n−1

f ( x'i ) =9 n+ 6i−101 ≤ i≤ n−1

f ( x'i ' )=9 n+6 i−9 1 ≤i ≤n−1

f ( y i) =9 n+6 i−81 ≤ i≤ n−1

f ( y 'i )=9 n+6 i−7 1≤ i≤ n−1

f ( y 'i' ) =9 n+6 i−6 1 ≤i ≤ n−1

Sincee f ( 1 )=11 n−9 and e f ( 0 ) =11n−10 , DQ n ⊙ k 2 is a difference cordial.

48
 CHAPTER–V

4-DIFFERENCE CORDIAL LABELING OF CYCLE AND

WHEEL RELATED GRAPHS

5.1 Theorem

Cycle C n is a 4 – difference cordial graph.

Proof:

Let V ( C n) ={ v 1 , v 2 , … , v n } .

We define labeling function f :V ( C n ) → {1,2,3,4 } as follows.

Case:(1) n is odd.

n−1
f ( v 4 i +1 )=1 ; 0 ≤i ≤ ⌊ ⌋
4

n−3
f ( v 4 i +2 )=2 ; 0 ≤i ≤ ⌊ ⌋
4

n−1
f ( v 4 i ) =3 ; 1≤ i ≤ ⌊ ⌋
4

n−3
f ( v 4 i +3 )=4 ; 0 ≤i ≤ ⌊ ⌋.
4

Case:(2) n is even.

Subcase:(1) n ≡ 0 ( mod 4 ) .

n
f ( v 4 i ) =1; 1 ≤i ≤
4

49
 n−4
f ( v 4 i +3 )=2 ; 0 ≤i ≤
4

n−4
f ( v 4 i +1 )=3 ; 0 ≤i ≤
4

n−4
f ( v 4 i +2 )=4 ; 0 ≤i ≤
4

Subcase:(2)n ≡2 ( mod 4 ) .

f ( v 1 )=2 ;

f ( v 2 )=1 ;

n−2
f ( v 4 i +1 )=1 ; 1≤ i≤
4

n−2
f ( v 4 i +2 )=2 ; 1≤ i≤
4

n−2
f ( v 4 i ) =3 ; 1≤ i≤
4

n−6
f ( v 4 i +3 )=4 ; 0 ≤i ≤
4

In each case cycle C n satisfies the conditions for 4 – difference cordial labeling.

Hence, C n is a 4 – difference cordial graph.

5.2 Example:

The 4 – difference cordial labeling of C 18 is shown in Figure 5.1

50
 Figure 5.1

5.3 Theorem:

W n is a 4 – difference cordial graph.

Proof:

Let v 0 be the apex vertex and v1 , v 2 , … , v n be the rim vertices of W n .

We define labeling function f :V ( W n ) → { 1,2,3,4 } as follows.

Case:(1) n is odd.

n−1
f ( v 4 i ) =1; 1 ≤i ≤ ⌊ ⌋
4

n−1
f ( v 4 i +1 )=2 ; 0 ≤i ≤ ⌊ ⌋
4

n−3
f ( v 4 i +2 )=3 ; 0 ≤i ≤ ⌊ ⌋
4

51
 n−3
f ( v 4 i +3 )=4 ; 0 ≤i ≤ ⌊ ⌋.
4

Case:(2) n is even.

f ( v 1 )=2 ,

f ( v 2 )=3 ,

f ( v 3 )=4 ,

n−3
f ( v 4 i +3 )=1 ; 1≤ i≤ ⌊ ⌋
4

n
f ( v 4 i ) =2; 1 ≤ i≤ ⌊ ⌋
4

n−2
f ( v 4 i +1 )=3 ; 1≤ i≤ ⌊ ⌋
4

n−2
f ( v 4 i +2 )=4 ; 1≤ i≤ ⌊ ⌋
4

In each case wheel graph W n satisfies the conditions of 4 – difference cordial labeling.
Hence, W n is 4 – difference cordial graph.

5.4 Example:

4 – difference cordial labeling of W 11 is shown in Figure 5.2.

52
 Figure 5.2

5.5 Theorem:

Crown C n ⊙ K 1 is a 4 – difference cordial graph.

Proof:

Let V ( C n ⊙ V K 1 )={ v 1 , v 2 , … , v n , v '1 , v '2 , … , v 'n }, where v1 , v 2 , … , v n are rim vertices and

v'1 , v '2 , … , v 'n are pendant vertices.

We define labeling function f :V ( C n ⊙ K 1 ) → { 1,2,3,4 } as follows.

Case:(1) n is odd.

n−1
f ( v 2 i+1 )=1 ; 0 ≤ i≤
2

n−1
f ( v 2 i )=2 ; 1≤ i≤
2

n−1
f ( v '2 i+1 ) =3 ; 0 ≤i ≤
2

53
 n−1
f ( v '2 i )=4 ; 1 ≤i ≤ .
2

Case:(2) n is even.

n−2
f ( v 2 i+1 )=1 ; 0 ≤ i≤
2

n
f ( v 2 i )=2 ; 1≤ i≤
2

n−2
f ( v '2 i+1 ) =3 ; 0 ≤i ≤
2

n
f ( v '2 i )=4 ; 1 ≤i ≤
2

In each case crown graph C n ⊙ K 1 satisfies the conditions of 4 – difference cordial labeling.
Hence, C n ⊙ K 1is 4 – difference cordial graph.

5.6 Example:

4 – difference cordial labeling of crown C 9 ⊙ K 1 is shown in Figure 5.3.

54
 Figure 5.3

5.7 Theorem:

H nis a 4 – difference cordial graph.

Proof:

Let V ( H n )= {v 0 , v 1 , … , v n , v '1 , v '2 , … , v 'n }, wherev0 is apex vertex, { v 1 , v 2 , … , v n } are rim vertices

and { v '1 , v '2 , … , v 'n } are pendant vertices.

We define labeling function f :V ( H n ) → {1,2,3,4 } as follows.

Case:(1) n is odd.

n−1
f ( v 4 i ) =1; 1 ≤i ≤ ⌊ ⌋
2

n−1
f ( v 4 i +1 )=2 ; 0 ≤i ≤ ⌊ ⌋
2

n−3
f ( v 4 i +2 )=3 ; 0 ≤i ≤ ⌊ ⌋
4

n−3
f ( v 4 i +3 )=4 ; 0 ≤i ≤ ⌊ ⌋
4

n−3
f ( v '4 i +3 )=1; 0 ≤ i≤ ⌊ ⌋
4

n−3
f ( v '4 i +2 )=2; 0 ≤ i≤ ⌊ ⌋
4

n−1
f ( v '4 i +1 )=3 ; 0 ≤ i≤ ⌊ ⌋
4

n−1
f ( v '4 i ) =4 ; 1≤ i≤ ⌊ ⌋
4

Case:(2) n is even.

55
 n−2
f ( v 2 i+1 )=2; 0 ≤ i≤
2

n
f ( v 2 i )=4 ; 1≤ i ≤
2

n−2
f ( v '2 i+1 ) =1; 0≤ i≤
2

n
f ( v '2 i )=3; 1 ≤ i≤
2

In each case helm graph H n satisfies the conditions of 4 – difference cordial labeling.

Hence, H n 4 – difference cordial graph.

5.8 Example:

4 – difference cordial labeling of helm H 9is shown in Figure 5.4.

Figure 5.4

5.9 Theorem:
56
 Gear G n is a 4 – difference cordial graph.

Proof:

Let V ( G n )= { v 0 , v 1 ,… , v 2n } , wherev0 is apex vertex, { v 1 , v 3 , … , v 2 n−1 } are the vertices of degree

3 and{ v 2 , v 4 ,… , v 2n } are the vertices of degree 2.

We define labeling function f :V ( Gn ) → {1,2,3,4 } as follows.

Case:(1) n is odd.

v 0=3.

n−1
f ( v 4 i +1 )=1 ; 0 ≤i ≤
2

n−1
f ( v 4 i +2 )=2 ; 0 ≤i ≤
2

n−3
f ( v 4 i +3 )=3 ; 0 ≤ i≤
2

n−3
f ( v 4 i +4 ) =4 ; 0 ≤ i≤
2

Case:(2) n is even.

v 0=1.

n
f ( v 4 i +1 )=1 ; 0 ≤i ≤ −1
2

n
f ( v 4 i +2 )=2 ; 0 ≤i ≤ −1
2

n
f ( v 4 i +3 )=3 ; 0 ≤ i≤ −1
2

n
f ( v 4 i +4 ) =4 ; 0 ≤ i≤ −1
2

57
In each case the gear graph G n satisfies the conditions of 4 – difference cordial labeling.
Hence, Gnis 4 – difference cordial graph.

5.10 Example:

4 – difference cordial labeling of G 5 is shown in Figure 5.5.

Figure 5.5

58