International Journal of Mathematics and

Computer Applications Research (IJMCAR)

ISSN(P): 2249-6955; ISSN(E): 2249-8060
Vol. 5, Issue 1, Feb 2015, 29-36
TJPRC Pvt. Ltd.

SIGNED PRODUCT CORDIAL IN CYCLE RELATED GRAPHS

SANTHI. M1 & J. JAMES ALBERT2
1
2

Ph.D Research Scholar, Karpagam University, Coimbatore, Tamil Nadu, India

HOD Department of Science and Humanities, Hindusthan Institute of Engineering and Technology,
Coimbatore, Tamil Nadu, India

ABSTRACT
A vertex labeling of graph G f: V(G) {-1,1}with induced edge labeling f*:E(G) {-1,1} defined by
f*(uv) = f(u)f(v) is called a signed product cordial labeling if

and

where vf

(-1) is the number of vertices labeled with -1 and vf (1) is the number of vertices labeled with +1, ef(-1) is the number of
edges labeled with -1 and ef(1) is the number of edges labeled with +1.In this paper derive signed product cordial
labeling for some cycle related graph operations.

KEYWORDS: Labeling, Product and Total Product Cordial Labeling, Signed Product Cordial Labeling
1. INTRODUCTION
We consider the simple, finite and connected graph G=(V(G), E(G)) without loops and multiple edges.
I have discussed the definitions of labeling, cordial labeling, Product cordial labeling, Total Product cordial
labeling, Signed product cordial labeling. Also I have discussed few theorems in signed product cordial labeling.
Jayapal Baskar Babujee, Shobana Loganathan (2011),2, p.1525-1530 proved that path graph, cycle graphs, Star
k1,n, Bistar Bn,n, Pn+, n 3 and Cn+, n 3 are signed product cordial.
A mapping f: V(G) { 0,1} is called binary vertex labeling of G. The induced edge labeling f* : E(G) { 0,1} is given by
f*(e=uv) =

.Let Vf(0), Vf(1) be the number of vertices labeled with 0 and 1 under f. Let ef(0), ef(1) be the

number of edges of G having labels 0 and 1 respectively under f*[2].A binary vertex labeling of graph G is called cordial
labeling if

and

. A graph G is cordial if it admits cordial labeling.

A binary vertex labeling of graph G with induced edge labeling f* : E(G) {0,1} defined by f*(e=uv)= f(u)f(v) is
called product cordial labeling if

and

.A graph G is product cordial if it admits

product cordial labeling[2].

A vertex labeling of graph G f: V(G) {-1,1} with induced edge labeling f* : E(G){-1,1} defined by f*(uv) =
f(u)f(v) is called signed product cordial labeling if

and

Where Vf(-1) is the

number of vertices labeled with -1, Vf(1) is the number of vertices labeled with 1.ef(-1) is the number of edges labeled with
-1 and ef(1) is the number of edges labeled with 1. A graph G is signed product cordial if it admits signed product cordial
labeling. In [4], Jayapal Baskar Babujee proved that path graph, cycle graphs, Star k1,n, Bistar Bn,n, Pn+, n 3 and Cn+, n 3
are signed product cordial.

www.tjprc.org

editor@tjprc.org

30

Santhi. M & J. James Albert

Let f be a function from V(G) to { 0,1,2.k-1} where k is an integer, 2 k

.For each edge uv, assign

1 I,j

the label f(u)f(v) (mod k) f is called a k- Total product cordial labeling of G if

{0,1,2.k-1}

where f(x) denotes the total number of vertices and edges labeled with x ( x=0,1,2,k-1).A graph with a k-total
product cordial labeling is called a k-Total product cordial labeling.
Duplication of a vertex vk by a new edge e = v v in a graph G produces a new graph G such that N(v) = {vk,
v} and N(v) = {vk, v}.Duplication of an edge e = vivi+1 by a vertex v in a graph G produces a new graph G such that N
(v) = {vi,vi+1}.
In this paper, the signed product cordial labeling is obtained for some cycle related graph operations.

2. MAIN RESULTS
Theorem 2.1 The cycle graph Cn 2k1 is Signed Product Cordial While n 2(mod4)
Proof
Let V (Cn 2k1) = {ui,vi,wi,1in} be vertex set and E(Cn) ={uiui +1; 1in-1}U{u1un} be the edge set of the cycle
Cn. E(2k1) ={uivi,uiwi, 1in } be the edge set of the cycle Cn.
Assume that n 0,1,3 (mod 4).
Define vertex labeling of the cycle f: V(G){-1,1} as follows,
For 1in,
f(ui) = 1

i=1,2 (mod 4)

f(ui) = -1

i=0,3 (mod 4)

f(vi) = -1

1 i n

f(wi) = 1

1 i n

The edge labeling of the cycle cn is

f(ui ui +1) = f(ui ) f(ui+1)
= 1 f(ui) and f (ui +1) have the same sign
=-1 f(ui) and f (ui +1) have different sign
In view of the above labeling pattern, we have
uf(-1)= uf(1) =
uf(1)=

when n= 0(mod 4)

, uf(-1) =

when n=

vf(-1) = n, wf(1) =n.

Impact Factor (JCC): 4.2949

Index Copernicus Value (ICV): 3.0

31

Signed Product Cordial in Cycle Related Graphs

Thus,

Hence The cycle graph Cn 2k1 is signed product cordial while n2 (mod4)
Remarks: The cycle graph Cn 2k1 is signed product cordial while n2 (mod4) as well as Total signed product
cordial.
The cycle graph C5 2k1 is signed product cordial is shown in figure.

Figure 1
Theorem 2.2 Cn k1

2k1 is Signed Product Cordial

Proof
Let u1, u2 ,, un-1, un be vertices of cycle cn.Let V(Cn

K1 ) = {ui,vi;, 1 i n} Let V(2k1) = {wi,xi,; 1 i n}

E(Cn) = {ui ui+1, 1 i n-1} {u1,un} be the edge set of cycle cn.
E(k1) = {ui,vi , 1 i n},E(2k1) = {vi wi, vi xi, 1 i n}
Define the vertex labeling of cn k1

2k1 is f:v(G){-1,1} the following cases to be considered.

We have to follow two cases

Case(i): when n is even
f(ui)=1

f(ui)=-1

f(vi)=1

f(vi)=-1 i
f(wi)=1

i n

f(xi)=-1

i n

In view of the above labeling pattern,we have

www.tjprc.org

editor@tjprc.org

32

Santhi. M & J. James Albert

uf(-1) = = uf(1)
uf(1) = = uf(-1)
wf(1) =n
xf(-1)=n.
Thus we have
,

Case(ii): when n is odd

f(ui)=1

f(ui)=-1

f(vi)=1

f(vi)=-1

f(vn)=-1
f(wi)=1

i n

f(xi)=-1

i n

In view of the above labeling pattern,we have

uf(1)=

, uf(-1)=

vf(1)=

, vf(-1)=

wf(1)=n, xf(-1)=n
Thus
Hence, Cn k1

2k1 is signed product cordial.

The cycle graph C5 k1

Impact Factor (JCC): 4.2949

2k1 is signed product cordial is shown in figure.

Index Copernicus Value (ICV): 3.0

33

Signed Product Cordial in Cycle Related Graphs

Figure 2
Theorem 2.3 The Star Graph k1,n

k1,2, n2 Admits Signed Product Cordial Labeling.

Proof
The star graph k1, n is a tree obtained by adding n pendant edge to the center vertex u.
Let u be the center of the star graph and u1 u2,,,,,un be the vertex set and the edge set is given by
E={u ui ;

i n}.

Consider the vertex vi is center of ui and ui+1 joining the vertex ui&ui+1 to vi through the edge e1,e2en.
The edge set is given by E= {uivi, ui+1vi;

i n}.

Define the vertex labeling for f: V(G){-1,1} is given by

i n

Let u=-1
f(ui)=1
f(ui)=-1

i 1(mod 2)
i 0(mod 2)

f(vi)=1
f(vi)=-1

i 1(mod 2)
i 0(mod 2)

The edge labeling is given by,

Assume that n is even,
f( uui)=-1
f(uui+1)=1
f(uivi)=1

i
i

f(ui+1vi)=-1

Assume that n is odd

f( uui)=-1
www.tjprc.org

-1
editor@tjprc.org

34

Santhi. M & J. James Albert

f(uui+1)=1

f(uivi)=1

f(ui+1vi)=-1

In view of the above labeling pattern, we have

Hence, The star graph k1,n
The Star Graph k1,n

k1,2, n2 admits signed product cordial labeling.

k1,2, n2 Admits Signed Product Cordial Labeling is Shown in Figure.

Figure 3
Theorem 2.4 The Graph Obtained by Duplicating Each by A Vertex in Cycle cn Admits Signed Product Cordial
Labeling While n 2(mod 4).
Proof
Let Cn be the graph obtained by duplicating each by a vertex in cycle cn.
Let v1,v2,vn be the vertices of Cn and v1,v2 ,vnbe the added vertices of Cn corresponding to
vertices v1,v2,vn in Cn.
Define f: V(Cn){-1,1} & f: V(Cn){-1,1}
E={vi vi+1,1 i n} be the edge set of the cycle Cn. E={vi vi, vi+1vi,1 i n} be the edge set of the cycle Cn.
We have to consider following two cases,
Case (i): Assume that n is odd
f(vi)=1

i 1,2(mod 4)

f(vi)=-1

i 0,3 (mod 4)

f(vi)= 1 i 1
f(vi)=-1

(mod 2)
i

0 (mod 2)

f(vn)=-1
In view of the above labeling pattern we have,

Impact Factor (JCC): 4.2949

Index Copernicus Value (ICV): 3.0

35

Signed Product Cordial in Cycle Related Graphs

Vertex and Edge Condition of a Cycle Graph Cn

Table 1
N

vf(-1)

vf(1)

1
n 3(mod 4)

1
Table 2

ef(-1)

ef(1)

1
n 3(mod 4)

Vertex and Edge Condition of a Cycle Graph Cn

Table 3
N

vf(-1)

vf(1)

n 3(mod 4)

Table 4
N

ef(-1)

ef(1)

n+

1
n 3(mod 4)

Case (ii): Assume that n is even

f(vi) = 1

i 1,2 (mod 4)

f(vi) =- 1

i 0,3 (mod 4)

f(vi)=1

i 1 (mod 2)

f(vi)=-1
Thus,

www.tjprc.org

i 0 (mod 2)
,

editor@tjprc.org

36

Santhi. M & J. James Albert

The graph obtained by duplicating each by a vertex in cycle cn admits signed product cordial labeling except
n 2(mod 4).
The graph obtained by duplicating each by a vertex in cycle c5 admits signed product cordial labeling except
n 2(mod 4).

Figure 4

CONCLUSIONS
As all the graphs are not signed product cordial graphs it is very interesting as well as to investigate signed
product cordial labeling for the graph or graph families which admits signed product cordial. Here, I have contributed some
new theorems related stars and cycle related graphs.

REFERENCES
1.

M. Sundaram, R. Ponraj and Somasundram. Total Product Cordial Labeling of graphs Bulletin of

Pure

and Applied Sciences: E. Mathematics and Statistics.Vol.25, 2006, pp.199-203.

2.

M. Sundram, R.Ponraj, S.Somasundram, Product cordial labeling of graph, Bulletin of Pure and Applied
Sciences. Vol 23(2004), pp.155-163.

3.

R. Ponraj, M.Sivakumar, M. Sundram. k-product cordial labeling of graphs Int. J.Contemp.Math.Sciences,

Vol.7, 2012, no.15, 733-742.

4.

Jayapal Baskar Babujee, Shobana Loganathan, On Signed Product cordial Labeling Applied Mathematics,
2011, 2, 1525-1530.

5.

Vaidya S K and Dani N A some new product cordial Graphs , Journal of App. comp. Sci. Math, vol. 8, no. 4,
pp. 62-65, 2010.

6.

R. Varatharajan, S.Navaneethakrishnan and K. Nagarajan, Divisor cordial labeling of graphs, International

journal of mathematical combinatorics, Vol. 4(2011), 15-25.

Impact Factor (JCC): 4.2949

Index Copernicus Value (ICV): 3.0