1

CHAPTER – I

GRAPH

A graph is an ordered pair G = (V,E) comprising a set of V of vertices or

nodes together with a set of edges or lines which are 2 – element subset of V.

A edge is related with two vertices and the relation is represented as an

unorder pair of the vertices with respect to the particular edge.

Example

Adjacent vertices

The edge E of an undirected graph G induce a symmetric binary relation

on V that is called the adjacenary relation of G. for each edge { u, v } the vertices u

and v said to be adjacent to one another which is denoted by u v.

Simple graph

Not a multigraph. There is no more than one edge between each pair of

vertices.
 2

Example

Self loop

A loop is an edge that connects a vertices to itself. A simple graph contains

no loops.

Example

Sub graph

A subgraph S of a graph G is a graph whose set of vertices and set of edges

are all subsets of G.

Example
 3

Degree of graph

The degree of a vertex of a graph is the number of edges incident to the

vertex, with loops counted of edges incident to the vertex, v is denoted deg (v) or

deg v. The maximum degree of a graph G denoted by (G) and the minimum

degree of a graph denoted by (G) are the maximum and minimum degree of its

vertices.

Example

(A graph with vertices labelled by degree )

In the graph on the right, the maximum degree is 5 and minimum degree is 0.

Regular graph

A regular graph is a graph where each vertex has the same number of

neighbours ( i.e,) every vertex has the same degree.

Complete graph

Let G = (V, E) be a simple graph every vertex is adjacent to every other

vertex. Then G is called complete.

 4

Example

Bipartite graph

It is a graph whose vertices can be divided into two disjoint sets u and v.

(i.e) U and V are independent sets every edge connects a vertex in U to one in V.

Vertex set u and v are often denoted as partite sets.

Example

Complete bipartite graph

It is a graph whose vertices can be partitioned into two subsets V1 &V2 no

edges has both end points in the same subset and every possible edge that could

connect vertices in different subsets is part of the graph. That is, if is a bipartite
 5

graph (V1, V2, E) for every two vertices v1 V1 & v2 V2, V1 V2 is an edge in E.

A complete bipartite graph with partitions of size∣V1∣= m and ∣V2∣= n is denoted

Km,n, every two graph with the same notation are isomorphic.

Example

For any is called , all complete bipartite graphs which are trees are stars.

Walk

A walk in a graph G is an alternating sequence 0 1, 1 2, 2,…, n n

vertices and edges beginning and ending with vertices in which i-1 iare the ends

of ei, V0 is the origin and Vn is the terminus of w.

Example

If we had the walk abcdcbce, then that could be perfectly fine even though

some edges are repeated.

 6

Paths

A path is defined as an open trail with no repeated vertices.

Example

Trails

A trail is defined as a walk with no repeated edges.

Example

Circuits

A circuit is a closed trail. That is, a circuit has no repeated edges but may

have repeated vertices.

 7

Example

Tree

A tree is a set of straight line segments connected at their ends containing no

closed loops ( cycle )

Example

Labeled graph

It is a graph whose vertices are each assigned an element from a set of

symbols.A graph which has no such labeling is called an unlabeled graph.

 8

Null graph

A graph in which all the vertices are isolated then it is known as a null

graph. A graph has no edges only vertices called the null graph.

Example

Friendship graph ( Fn)

The friendship graph Fn is a planar undirected graph with 2n + 1 vertices

and 3n edges.

The friendship graph Fn can be constructed by joining n copies of the cycle

graph C3 with a common vertices.

Example

Vertex labeling

A graph labeling is an assignment of integers to the vertices or edges or both

subject to certain condition [ ]. If the domain of the mapping is the set of vertices (

or edges ) then the labeling is called a vertex labeling ( or an edge labeling )

 9

According to Boineue and Hedge [1] labeling of discrete structure servers as

a frontier between graph theory and theory of numbers. A dynamic survey of graph

labeling is carried out and frequently updated by Gallian [4].

Definition

A mapping is called binary vertex labeling of G and is

called the label of the vertex V of G under f.

*
The induced edge labeling is given by * =

Let us denote f (0), f (1) be the number of vertices of G having labels 0 and 1

respectively under f and let f (0), f (1) be the number of edges of G having labels

0 and 1 respectively under *.

Definition 1.5

The wheel graph n is defined to be the join 1 + n. The vertex

corresponding to k 1 is known as apex vertex and vertex corresponding to cycle are

known as rim vertex while the edge corresponding to cycle are known as rim edge.

We continue to recognize apex of respective graphs obtained from wheel in

definition 1.6 to 1.9.

Definition 1.6

The helm n is the graph obtained from a wheel n by attaching a pendant

edge to each rim vertex.

 10

Definition 1.7

The closed helm n is the graph obtained from a helm Hn by joining each

pendant vertex to form a cycle.

Definition 1.8

The web graph n in the graph obtained by joining the pendant vertices of

a helm Hn to form a cycle and then adding a pendant edge to each vertex of outer

cycle.

Definition 1.9

The flower n is the graph obtained form a helm Hn by joining each

pendant vertex to the apex of the helm.

Definition 1.10

The double triangular snake DTn is obtained from a path Pn with vertices 1

2 … n by joining i and i +1 to a new vertex i for = 1,2, … -1 and to a new

vertex ui for = 1,2, … -1.

Definition 1.11

Let = be an edge of graph G and is not a vertex of G. The edge e is

n
subdivided when it is replaced by edge ' = and = .

Definition 1.12

The gear graph Gn is obtained from the wheel by subdividing each of its rim

edge.
 11

Definition

If the vertices of the graph are assigned values subject to certain condition

(S). then is known as graph labelling.

For an extensive survey on graph labeling and bibliographic reference we

refer to Gallian [2]

Definition

A mapping : ) { 0,1 } is called binary vertex labelling of and

( ) is called the label of the vertex V of G under f.

The induced edge labeling * : ( ) { 0,1 } is given by * ( )=

Let us denote,

f (0) = number of vertices of G having label 0 under .

f (1) = number of vertices of G having label 1 under .

f = number of edges of G having label 0 under *.

f(1) = number of edges of G having label 1 under *.

Definition

A binary vertex labeling of a graph G is called a cordial labeling if | f (0) –

f (1) | ≤ 1 and | f (0) – f (1) | ≤ 1. A graph G is called cordial if it admits cordial

labeling.
 12

Definition

A binary vertex labeling of graph G with induced edge labelling * : ( )

{ 0,1 } defined by * ( = )= ( ) ( ) is called a product cordial labeling

if | f (0) – f (1) | ≤ 1 and | f (0) – f (1) | ≤ 1. A graph is called product cordial if it

admits product cordial labeling.

Definition

Duplication of a vertex k by a new edge = in a graph G produces a

new graph such that ( )={ k , } and ( )={ k , }.

Definition

Duplication of an edge = i i+1 by a vertex in a graph G produces a

new graph such that ( )={ i , i+1 }.

Definition

For a graph G the split graph is obtained by adding to each vertex , a new

vertex such that is adjacent to each vertex that is adjacent to in . The

resultant graph is denoted by spl ( ).

Definition

Let G be a graph with two or more vertices than the total graph ( ) of

graph G is the graph whose vertex set is ( ) ( ) and two vertices are adjacent

whenever they are either adjacent or incident in .

 13

Definition

Consider two copies of graph ( wheel, star, fan and friendship ) namely 1

and 2 then the graph = < 1 2> is the graph obtained by joining the apex

vertices of ! and 2 by an edge as well as to a new vertex .

Cordial if its admits cordial labeling

A binary vertex labeling of a graph G is called a cordial labeling if | f (0) –

f (1) | ≤ 1 and | f (0) – f (1) | ≤ 1. A graph G is called cordial if it admits cordial

labelling.

Definition

For an integer > 1. A mapping : ( ) { 0,1,2, … , } is called a

samarandachely – product cordial labeling if | f (0) – f (1) | ≤ 1 and | f (0) – f (1)

| ≤ 1 for any , { 0, 1, … , -1 } where Vf (i) denotes the number of vertices

labeled with i, ef (i) denotes the number of edges with ( ) ( ) ( )

particularly, if = 2 i.e, a binary vertex labeling of graph with an induced edge

labeling * : ( ) { 0,1 } defined by * ( = ) = ( ) ( ) such a

smarandachely 2 – product cordial labeling is called product cordial labeling is

called a product cordial graph.

 14

CHAPTER – II

PRODUCT CORDIAL LABELING FOR SOME NEW GRAPHS

Introduction

We begin with finite, connected and undirected graph = ( V ( ), ( ))

without loops and multiple edges. Here Cn and Pn denote the cycle and path

respectively.

Definition

If the vertex of the graph are assigned values subject to certain conditions

then it is know as graph labeling.

Most of the graph labeling problems have following three common

characteristics.

1) A set of numbers for assignment of vertex labels

2) A rule that assign a label to each edge.

3) Some condition (S) that these labels must satisfy.

Definition

A mapping : ( ) { 0,1 } is called binary vertex labeling of and

( ) is called the label of vertex of under .

The induced edge labeling * : ( ) { 0,1 } is given by * ( = )=

| ( ) – ( )|. Let f (0). f (1) be the number of vertices of having labels 0 and 1
 15

respectively under f and let f(0), f (1) be the number of edges of having labels 0

and 1 respectively under *.

Definition

A binary vertex labeling of graph G is called cordial labelling if | f(0) –

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

The concept of cordial labeling was introduced by ( cahit I 1987, P 201 –

207) and in the same paper he investigated several results and this newly introduced

concepts.

Some labeling with variations in cordial theme have also been introduced

such as prime cordial labeling. A – cordial labeling, E – cordial labeling, H –

cordial labeling, product cordial labeling etc. The present paper is aimed to

investigate some results on product cordial labeling in which absolute difference is

replaced by product of the vertex labels.

Definition

A binary vertex labeling of graph G with induced edge labeling * : ( )

{ 0,1 }. Defined by *( = ) = ( ) ( ) is called a product cordial labeling if

| f(0) – f(1)| ≤ 1 and | f(0) – f(1)| ≤ 1. A graph G is product cordial if it admits

product cordial labeling.

 16

Definition

The middle graph ( ) of a graph is the graph whose vertex set is ( )

( ) and in which two vertices are adjacent iff either there are adjacent edges of

or one is a vertex of and the other is an edge incident with it.

Definition

The friendship graph n is one point union of n copies of cycle 3

Definition

A chord of cycle, n is an edge joining two non – adjacent vertices of cycle n.

Definition

Two chords of a cycle n are said to be twin chord if they form a triangle with

an edge of cycle n. In present investigated we prove that the friendship graph,

cycle with one chord, cycle with twin chord and middle graph of path are product

cordial graph.

MAIN RESULTS ;

Theorem 2.1

Fn is product cordial.

Proof

Let Fn br the friendship graph with n copies of cycle C3. Let be the apex

vertex 1, 2… 2n be the other vertices and 1 2 … 3n be the edges of n.

 17

Define : ( n)  { 0,1 } we consider following two cases.

Case 1 : when n is even

( i) = 0, 1≤ ≤

( i) = 1, otherwise

( )=1

In view of the above labeling pattern we have,

f (0) = f (1) – 1 =

f (0) = f(1) = 3 /2

Case 2 : when n is odd

( i) = 0, 1≤ ≤

( i) = 1, otherwise

( )=1

In view of the above labeling pattern we have,

f (0) +1 = f (1) = +1

f (0) = f(1) +1 = [3 /2]

Thus is each cases we have | f(0) – f(1)| ≤ 1 and | f(0) – f(1)| ≤ 1. Hence Fn is

product cordial.
 18

Illustration 2.2

Consider the graph F5. The product cordial labeling is shown in fig.

Theorem 2.3

Cycle Cn with one chord is product cordial except when n is even and the

chord is joining the vertices at diameter distance.

Proof

Let G be the cycle graph with one chord. Let 1 2 ... n be the vertices of G.

Here graph has a vertices and +1 edges.

Define : ( )  {0,1} we consider following two cases.

Case 1 ; When is odd.

Without loss generality we assume that let the chord is between vertex (

, i) where 3 ≤ ≤ [ /2 ]
 19

( i) = 1, 1 ≤ ≤ [ /2 ]

( i) = 0, otherwise.

In view of the above labeling pattern we have,

f (0) + 1 = f(1) = [ /2]

f(0) = f(1) = +1 / 2

Case 2 ; when n is even

Without loss of generality we assume that let the chord is between vertex (

1, i ) where 3 ≤ ≤ /2 + 1.

Subcase 1:

When chord is between ( 1 , i ) where = /2 +1. In order to satisfy the

vertex condition for product cordial graph it is essential to assign label 0 to /2

vertices out of total n vertices. The vertices with label 0 will give rise atleast /2+2

edges with label 0 and at most n/2-1 edges with label 1 out of total n+1 edges of .

therefore | f (0)– f ( 1 ) |= 3. Thus the edges condition for product cordial graph

in violated. Hence G is not product cordial.

Subcase 2:

When chord is between ( 1 , i ) where3 ≤ ≤ /2.

i a

i
 20

In view of the above labeling pattern we have,

f f

f f

Thus in each cases we have | f f and | f f

. Hence cycle cn with one chord is product cordial.

Theorem 2.5

Cycle Cn with twin chords is product cordial when n is even and one of the

chord joining vertices at diameter distance.

Proof:

Let G be the cycle graph with twin chords. Let 1 2 … n be the vertices of

. Here graph has vertices and vertices and + 2 edges. Define

we consider following two cases.

Cases 1: when n is odd.

Without loss of generality we assume that let the chords are between vertex

( 1 , i ) and

1, i+1 where

i
 21

i otherwise

i i

i otherwise

In view of the above labeling pattern we have.

f f(

f f

Thus in each case we have f f and f(0) f

Hence M ( pn ) is product cordial.

Illustration 2.8

Consider the graph M ( p7 ). The product cordial labeling is show in figure 4.

M ( p7 ) with product cordial labeling.

 22

Further Result On Product Cordial Labeling

Main Result:

Theorem 2.1

Closed helmCHn is a product cordial graph.

Proof:

Let be the apex Vertex 1 2.... n be the vertices of inner cycle and 1 2

… n be the vertices of outer cycle CHn. then |V(CHn) | = 2n+1 and |E(CHn)| = 4n

We define f : ( n) {0,1} to be ( ) = 1, ( i) = 1 and ( i) = 0 for all

. In view of the above labeling pattern we havw f(0) = f(1) =1= f(0) = f(1) =

2 . thus we have | f(0) – f(1)|≤ 1 and | f(0) – f(1)|≤ 1. Hence n is a product

cordial graph.

Illustration

The fig 1, shows the closed helm 5 and its product cordial labeling.
 23

Theorem 2.3

Web graph wbn admits product cordial labeling.

Proof

Let V be the apex vertex 1 2 … nbe the vertices of inner cycle n+1

, n+2,… 2n be the vertices of outer cycle and 2n+1 , 2n+2 ,… , 3n be the pendant

vertices in wbn. Then | ( bnf)| = 3 +1 and | ( n)| = 5n.

To define : ( n)  { 0,1} we consider following two cases.

Case is odd

Define i) for 2i for

and i otherwise.

In view of the above labeling pattern we have f f

f f .

Case II, n is even.

Define i) for 2i+1 for

and i otherwise.

In view of the above labeling pattern we have f f

f f . Thus in each case we have | f(0) – f(1) | ≤ 1 and

| f(0) – f(1) | ≤ 1..

Hence wbn admits product cordial labeling

 24

Illustration 2.4

The fig.2 shows the web graph wb5 and its product cordial labeling.

Theorem 2.5

Flower graph Fln admits product cordial labeling.

Proof

Let Hn be the helm with V as the apex vertices 1 2… n be the vertices of

the cycle and n+1, n+2, … V2n be the pendant vertices. Let Fln be the flower graph

obtained from helm Hn. thus | ( n)| = 2n+1 and | ( n)| =4 .

We define f : ( n)  {0,1} to be

In view of the above labeling pattern we have f(0) = f(1) –1=

k,, f(0) = f(1) = 2 . Thus we hav | f(0) – f(1) | ≤ 1 and | f(0) – f(1) | ≤ 1.

Hence n admits product cordial labeling.

 25

Illustration

In fig 3 shows flower graph Fl5 and its product cordial labeling.

Theorem 2.7

Double triangular snake DTn is a product cordial graph for odd n and not a

product cordial graph for even n.

Proof

Let 1, 2,…, n be the vertices of path Pn and n+1, n+2, … 3n-2 be the

newly added vertices in order to obtain then | ( n)| = 3 -2 and | ( n)| = 5n-5

Case I, n is odd

( i) = 0 for 1 ≤ ≤ [ /2], ( i) = 0 for +1 ≤ i ≤ +[ /2] and ( i) = 1

otherwise, in view of the above labeling pattern we have f(0) +1 = f(1) = [3 -

2/2], f(0)-1 = f(1) = 5 -5/2.Thus we have | f (0) – f(1)| ≤ 1 and | f(0) – f(1)| ≤ 1.
 26

Case II, n is even

Sub – case 1, n = 2

2
The graph DT2 has p = 4 vertices and q = 5 edge since, + 1 = 19/4 <

Thus the necessary condition for product cordial graph is violated. Hence 2

is not a product cordial graph.

Sub – case 2, n≠2

In order to satisfy the vertex condition for product cordial graph it is essential

to assign label 0 to 3 -2/2 vertices out of 3 -2 vertices. The vertices with label 0

will give rise at least 5 /2 - 1 edges with label 0 and at most 5 /2 - 4 edge with

label 1 out of total 5 - 5 edges. Therefore | f(0) – f(1)| = 3. Thus the edge

condition for product cordial graph is violated. Therefore n is not a product

cordial graph for even n.

Hence double triangular snake n is a product cordial graph for odd n and not

a product cordial graph for even n.

Illustration 2.8

The fig. 4 shows the double triangular snake n and its product cordinal

labeling.
 27

Theorem 2.9

Gear graph Gn is a product cordial graph for odd n and not product cordial

graph for even n.

Proof

Let n be the wheel with apex vertex v and rim vertices 1, 2, …, n. To

obtain the gear graph Gn subdivide each rim edge of wheel by the vertices 1, 2,

…, n where each i subdivides the edge i i+1 for = 1,2,…, -1 and n sub

divides the edge 1 n. then | ( )| = 2 +1 and | ( )| = 3 .

To define : ( n)  {0,1} we consider the following two cases.

Case I, n is odd

( )=1; ( i) = 1 1 ≤ ≤ [ /2]

( i) = 0, otherwise

( i) = 1,

1≤ ≤ + [ /2]

( i) = 0, otherwise

In view of the above labeling pattern we have,

f(0) = f(1)-1= ,

f(0) = f(1)+1 = 3 +1/2.

Thus we have | f(0) – f(1)|≤ 1 and | f(0) – f(1)|≤1.

 28

Case II, is even

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to vertices out of 2 +1 vertices. The vertices with label

0 will give rise at least 3 /2+1 edges with label 0 and at most 3 /2 - 1 edge with

label 1 out of total 3n edges. Therefore | f(0) – f(1)| = 2. Thus the edge condition

for product cordial graph is violated. Hence n is not a product cordial graph for

even n.

Hence gear graph is a product cordial graph for odd n and not product

cordial graph for even n.

Illustration

The fig. 5 shows the gear graph G7 and its product cordial labeling.
 29

UNIT – III

PRODUCT CORDIAL GRAPHS IN THE CONTEXT OF SOME

GRAPH OPERATIONS

Main Results

Theorem 2.1

The graph obtained by duplication of an arbitrary vertex by a new edge in

cycle Cn is product cordial.

Proof

Let 1, 2, … , n be vertices and 1, 2, … , n be edges of cycle n.

Without loss of generality we duplicate the vertex n by an edge n+1 with end

vertices as 1’ and 2’. Let the graph so obtained G. Then | ( )| = +2 and | ( )|

= +3.

To define f : ( )  {0,1} we consider following two cases.

Case I, n is odd.

i otherwise

In view of the above labeling pattern we have,

 30

f f

f f

Case II, n is even

i otherwise

In view of the above labeling pattern we have,

f f

f f

Thus in each cases we have | f(0) – f(1)| ≤ 1 and | f(0) – f(1)| ≤ 1.

Hence the graph obtained by duplication of an arbitrary vertex by a new edge in

cycle Cn is product cordial.

Illustration 2.2

The graph obtained by duplication of a vertex by an edge in C7 and its

product cordial labeling is shown in fig.

 31

Theorem

The graph obtained by duplication of an arbitrary edge by a new vertex in

cycle Cn is product cordial expect for n = 3.

Proof

Let 1, 2, …, n be vertices and 1, 2, …, n be edges of cycle Cn. without

loss of generality we duplicate the edge n-1 n by a vertex . Let the graph

obtained in G. Then | ( )| = n+1 and | ( )|= n+ . Let the vertex so added is .

To define : ( )  {0,1} we consider following three cases.

Case I, when is odd (n≠3)

i otherwise

In view of the above labeling pattern we have

f f

f f

Case II, n is even

( i

( i other wise
 32

In view of the above labeling pattern we have

f f

f f

This in case 1 and case 2 we have f(0) f and f(0) f(1)

Case III, when n = 3

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to 2 vertices out of 4 vertices. The vertices with label 0

will give rise at least 4 edges with label 0 and at most 1 edge with label 1 out of

total 5 edges.

Therefore | f(0) – f(1)| = 3. Thus the edge condition for product cordial

graph is violated. Hence G is not a product cordial graph.

Hence we conclude that the graph obtained by duplication of an arbitrary

edge by a new vertex in cycle Cn is product cordial expect for n = 3.

Illustration 2.4

The graph obtained by duplication of an edge by a vertex in C8

and its product cordial labeling is shown in fig.

 33

Theorem 2.5.

The graph obtained by duplication all the vertices by edges in cycle n is not

product cordial expect for =3

Proof

Let 1, 2,…, n be vertices and 1, 2,…, n be edges of cycle n. Let the

graph obtained by duplication all the vertices by edges in cycle n is . then | ( )|

= 3 and | ( )| = 4 . We consider the following three cases.

Case I, =3

The graph obtained by duplication all the vertices by edges in cycle C 3and

its product cordial labeling is shown in fig.3

Case II, n is odd

In order to satisfy the vertex condition for product cordial graph if its

essential to assign label 0 to [3 /2] vertices out of 3 vertices. The vertices with

label 0 will give rise at least 2n+1 edges with label 0 and at most 2 -1 edge with

label 1 out of total 4n edges.

 34

Therefore | f(0) – f(1)| = 2. Thus the edge condition for product cordial

graph is violated. Hence is not a product cordial graph.

Case III, n is even

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to 3 /2 vertices out of 3 vertices. The vertices with label

0 will give rise atleast 2 +1 edges with label 0 and at most 2 -1 edge with label 1

out of total 4n edges. Therefore | f(0) – f(1)| = 2. Thus the edge condition for

product cordial graph is violated. Hence G is not a product cordial graph.

Hence we conclude that duplication all the vertices by edges in cycle n is

not product cordial expect for = 3.

Theorem 2.6

The graph obtained by duplication all the edges by vertices in cycle Cn is not

product cordial

Proof

Let 1, 2,…, n be vertices and 1, 2,…, nbe edges of cycle n. Let the

graph obtained by duplication all the vertices by edges in cycle n is . then | ( )|

= 2 and | ( )| = 3 . We consider the following two cases.

Case I, n is odd

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to n vertices out of 2 vertices. The vertices with label 0

will give rise atleast [3 /2]+1 edges with label 0 and at most [3 /2]-1 edge with
 35

label 1 out of total 3n edges. Therefore | f(0) – f(1)| = 3. Thus the edge condition

for product cordial graph is violated. Hence G is not a product cordial graph.

Case II, n is even

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to n vertices out of 2 vertices. The vertices with label 0

will give rise atleast 3 /2+2 edges with label 0 and at most 3 /2-2 edge with label 1

out of total 4 edges. Therefore | f(0) – f(1)| = 4. Thus the edge condition for

product cordial graph is violated. Hence G is not a product cordial graph.

Hence we conclude that duplication all the vertices by edges in cycle n is

not product cordial.

Theorem 2.7

The graph obtained by duplication all the vertices by edges in path Pn is

product cordial.

Proof

Let 1, 2,…, n be vertices and 1, 2,…, n be edges of cycle Cn. Let the

graph obtained by duplication all the vertices by edges in the path Pn is . then

| ( )| = 3 and | ( )| = 4 -1. Let the edge so added corresponding to vertex n has

end vertices as n and n .

To define f : ( )  {0,1} we consider the following two cases.

Case I, n is odd
 36

( j) = 0, 1 ≤ ≤ [ /2]

( i) = 1, otherwise

( j ) = 0, 1 ≤ ≤ [ /2]

( i ) = 1, otherwise

( j ) = 0, 1 ≤ ≤ [ /2]

( i ) = 1, otherwise

In view of the above labeling pattern we have,

f(0) = f(1)-1= [3 /2]

f(0) = f(1)+1 = 2 .

case II, is even

( j) = 0, 1 ≤ ≤ [ /2]

( i) = 1, otherwise

( j ) = 0, 1 ≤ ≤ [ /2]

( i ) = 1, otherwise

( j ) = 0, 1 ≤ ≤ [ /2]

( i ) = 1, otherwise

In view of the above labeling pattern we have,

f(0) = f(1)= [3 /2]

 37

f(0) = f(1)+1 = 2 .

Thus in case I and case II are having | f(0) – f(1)|≤ 1 and | f(0) – f(1)|≤1.

Hence duplication all the vertices by edges in path Pn is product cordial.

Illustration 2.8

The graph obtained by duplication all the vertices by edges in path P5 and its

product cordial labeling is shown in fig.

Theorem 2.9

The graph obtained by duplication of an arbitrary vertex by a new edge in

path Pn is product cordial expect for n = 2.

Proof

Let 1, 2,…, n be vertices and 1, 2,…, n be edges of cycle Cn. Let the

graph obtained by duplication of an arbitrary vertices by a new edges is . then

| ( )| = +2 and | ( )| = +2. Let the edge so added has end vertices as V1’ and

V2’’.

To define : ( )  {0,1} we consider the following three cases.

 38

Case I, n is odd

Sub –case 1 : when vertex k, = [ /2] is duplicated

( j) = 1, [ /2] ≤ ≤ 2 [ /2]

( i) = 0, otherwise

( j ) = 1, = 1,2,…

In view of the above labeling pattern we have,

f(0) = f(1)-1= [ /2]

f(0) = f(1)-1 = [ /2].

Sub –case 2 : when vertex k, ≠ [ /2] is duplicated

Without loss of generality we can assume that the duplication vertex would

be k, ≤ ≤ [ /2] then f is defines as follows.

( j) = 1, 1 ≤ ≤ 2 [ /2]

( i) = 0, otherwise

( j ) = 1, = 1,2,…

In view of the above labeling pattern we have,

f(0) = f(1)-1= [ /2]

f(0) = f(1)-1 = [ /2]

 39

Case II, n is even (n≠2)

Without loss of generality we can assume that the duplication vertex would

be k, ≤ ≤ [ /2] then f is defines as follows.

( j) = 1, ≤ ≤ + [ /2] -2

( i) = 0, otherwise

( j ) = 1, = 1,2,…

In view of the above labeling pattern we have,

f(0) = f(1)= [ /2]+1

f(0) = f(1) = [ /2]+1

Case III, when =2

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to 2 vertices out of 4 vertices. The vertices with label 0

will give rise at least 3 edges with label 0 and at most 1 edge with label 1 out of

total 4 edges. Therefore | f(0) – f(1)| = 2. Thus the edge condition for product

cordial graph is violated. Hence is not a product cordial graph.

Hence we conclude that the graph obtained by duplication of an arbitrary

vertices by a new edges in path Pn is product cordial expect for = 2.

Illustration 2.10

The graph obtained by duplication all the vertices by edges in path P5 and its

product cordial labeling is shown in fig.5

 40

Theorem 2.11

The graph obtained by duplication of an arbitrary edge by a new edge in

path Pn is product cordial expect for = 3.

Proof

Let 1, 2,…, n be vertices and 1, 2,…, n be edges of path n. Let the graph

obtained by duplication of an arbitrary edges by a new edges is . then | ( )| =

+1 and | ( )| = +1. Let the vertex so added is .

To define f : ( )  {0,1} we consider the following four cases.

Case I, when =2

The graph obtained by duplication of an edge by a vertices in path 2 and its

product cordial labeling is shown in fig.6

Case II, when is odd ( ≠3)

Without loss of generality we can assume that the duplication edge would be

k, 1≤ ≤ [ /2] then f is defines as follows.

 41

( j) = 1, ≤ ≤ + [ /2] +1

( i) = 0, otherwise

( j ) = 1,

In view of the above labeling pattern we have,

f(0) = f(1)= [ +1/2]

ef(0) = ef(1) = [n+1/2]

Case III, when is even ( ≠3)

Without loss of generality we can assume that the duplication edge would be

k, 1≤ ≤ [ /2] then f is defines as follows.

( j) = 1, ≤ ≤ + [ /2] -1

( i) = 0, otherwise

(j ) = 1,

In view of the above labeling pattern we have,

f(0) = f(1)-1= [ /2]

f(0) = f(1)-1 = [ /2]

Thus in case we have | f(0) – f(1)| ≤ 1 and | f(0) – f(1)| ≤ 1.

 42

Case 4 : when =3

In order to satisfy the vertex condition for product cordial graph it is essential

to assign label 0 to 2 vertices out of 4 vertices. The vertices with label 0 will give

rise at least 3 edges with label 0 and at most 1 edge with label 1 out of total 4 edges.

Therefore | f(0) – f(1)| = 2. Thus the edge condition for product cordial graph is

violated. Hence G is not a product cordial graph.

Hence we conclude that the graph obtained by duplication of an arbitrary

edge by a new vertices in path Pn is product cordial expect for = 3.

Illustration 2.12

The graph obtained by duplication of an edges by a vertices in 6 and its

product cordial labeling is shown in fig.7

Theorem 2.13

Spl (Pn) is a product cordial graph expect for odd n.

Proof

Let 1, 2,…, n be vertices and 1, 2,…, n be edges of path Pn. to obtain Spl

(Pn) let added vertices are 1 2 … n corresponding to 1, 2,…, n. Let G be the

graph Spl(Pn) then | |=2 and | |=3 -3.

 43

To define :  we consider the following three cases.

Case I: when n=2

Spl (P2) and its product cordial labeling is shown in fig 8

Case II, when n is even (n≠2)

i otherwise

In view of the above labeling pattern we have,

f f

f f

Thus in case I and case II we have | f – f and f – f

Case III, when n is odd

In order to satisfy the vertex condition for product cordial graph it is

essential to assign label 0 to n vertices out of vertices. The vertices with label 0
 44

will give rise at least 3n-1/2 edges with label and at most edge with

label out of total edges. Therefore f – f . Thus the edge

condition for product cordial graph is violated. Hence G is not a product cordial

graph.

Hence we conclude that Spl (Pn) is product cordial graph expect for odd n.

Illustration:

Spl (P6) and its product cordial labeling is shown in fig.9

Theorem 2.15

Let 1 2 nbe vertices and 1 2 n-1be edges of path Pn. Then

1 are vertices of T(Pn). Let G be the graph T(Pn) then

-1 and

To define f :  we consider the following two cases.

Case I, when n is odd

otherwise

j
 45

i otherwise

In view of the above labeling pattern we have,

f f

f f

Case II, when n is even

( i otherwise

i otherwise

In view of the above labeling pattern we have,

f f

f f n

Thus in case I and case II we have f – f f – f

Hence T(Pn) is a product cordial graph.

Illustration 2.16

T(Pn) and its product cordial labeling is shown in fig.

 46

Theorem 2.17

Graph < G1 G2> is product cordial.

Proof

Le 1 2 n be the vertices of G1 and 1 2 n be the vertices of G2.

Let G be the graph 1 2 and

To define f :  we have

In view of the above labeling pattern we have,

f f

f f

Thus we have f – f and f – f

Hence the graph 1 2 is product cordial.

 47

Illustration 2.18

Graph 1,5 1,5 and its product cordial labeling is shown in fig.11