International J.Math. Combin. Vol.

2(2016), 144-152

Cycle and Armed Cap Cordial Graphs

A.Nellai Murugan
(Department of Mathematics , V.O.Chidambaram College, Tamil Nadu, India)

P.Iyadurai Selvaraj
(Department of Computer Science, V.O.Chidambaram College, Tamil Nadu, India)
E-mail: anellai.vocc@gmail.com, iyaduraiselvaraj@gmail.com

Abstract: Let G = (V,E) be a graph with p vertices and q edges. A Cap () cordial
labeling of a Graph G with vertex set V is a bijection from V to 0,1 such that if each edge
uv is assigned the label

1, if f(u)=f(v)=1,
f (uv) =
0, otherwise.

with the condition that the number of vertices labeled with 0 and the number of vertices
labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number
of edges labeled with 1 differ by at most 1. Otherwise, it is called a Smarandache cordial
labeling of G. A graph that admits a cordial labeling is called a cordial graph (CCG).
In this paper, we proved that cycle Cn (n is even), bistar Bm,n , Pm Pn and Helm are
cordial graphs.

Key Words: Cap cordial labeling, Smarandache cordial labeling, Cap cordial graph.
AMS(2010): 05C78.

1. Introduction
A graph G is a finite non-empty set of objects called vertices together with a set of unordered
pairs of distinct vertices of G which is called edges. Each pair e = {uv} of vertices in E is
called an edge or a line of G. In this paper, we proved that Cycle Cn (n : even), Bi-star Bm ,n ,
Pm Pn and Helm are cordial graphs.

2. Preliminaries
Let G = (V,E) be a graph with p vertices and q edges. A (cap) cordial labeling of a Graph G

1 Received

February 10, 2015, Accepted December 15, 2015.

Cycle and Armed Cap Cordial Graphs

145

with vertex set V is a bijection from V to (0, 1) such that if each edge uv is assigned the label

1, if f (u) = f (v) = 1
f (uv) =
0, otherwise.

with the condition that the number of vertices labeled with 0 and the number of vertices labeled
with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges
labeled with 1 differ by at most 1. Otherwise, it is called a Smarandache cordial labeling of
G.
The graph that admits a cordial labeling is called a cordial graph (CCG). we proved
that cycle Cn (n is even), bistar Bm,n , Pm Pn and Helm are cordial graphs
Definition 2.1 A graph with sequence of vertices u1 , u2 , , un such that successive vertices
are joined with an edge, Pn is a path of length n 1.
The closed path of length n is Cycle Cn .

Definition 2.2 A Pm Pn graph is a graph obtained from a path Pm by joining a path of

length Pn at each vertex of Pm .
Definition 2.3 A bistar is a graph obtained from a path P2 by joining the root of stars Sm and
Sn at the terminal vertices of P2 . It is denoted by Bm , n.
Definition 2.4 A Helm graph is a graph obtained from a Cycle Cn by joining a pendent vertex
at each vertex of on Cn . It is denoted by Cn K1 .
3. Main Results
Theorem 3.1 A cycle Cn (n : odd) is a cordial graph
S
Proof Let V (Cn ) = {ui : 1 i n}, E(Cn ) = {[(ui ui+1 ) : 1 i n 1] (u1 un )}. A
vertex labeling f : V (Cn ) {0, 1} is defined by

0, 1 i n1 ,
2
f (ui ) =
1, n+1 i n
2

with an induced edge labeling f (u1 un ) = 0,

0, 1 i n1 ,
2
f (ui ui+1 ) =
1, n+1 i n 1,
2

Here V0 (f ) + 1 = V1 (f ) and E0 (f ) = E1 (f ) + 1. It satisfies the condition

|V0 (f ) V1 (f ) | 1,

|E0 (f ) E1 (f ) | 1.

146

A.Nellai Murugan and P.Iyadurai Selvaraj

Hence, Cn is cordial graph.

For example, C7 is cordial graph as shown in the Figure 1.
1

u7
0

u1

u6
1

0
0

u5

u2
0
0

u3

u4

Figure 1 Graph C7
Theorem 3.2 A star Sn is a cordial graph.
Proof Let V (Sn ) = {u, ui : 1 i n} and E(Sn ) = {(uui ) : 1 i n}. Define
f : V (Sn ) 0, 1 with vertex labeling as follows:
Case 1. If n is even, then f (u) = 1,

and an induced edge labeling

0, 1 i n ,
2
f (ui ) =
1, n + 1 i n
2

0, 1 i n ,
2
f (uui ) =
1, n + 1 i n.
2

Here V0 (f ) + 1 = V1 (f ) and E0 (f ) = E1 (f ). It satisfies the condition

|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.
Case 2. If n is odd, then f (u) = 1,

0, 1 i n+1 ,
2
f (ui ) =
1, n+3 i n
2

and with an induced edge labeling

0, 1 i n+1 ,
2
f (uui ) =
1, n+3 i n.
2

Cycle and Armed Cap Cordial Graphs

147

Here V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ) + 1. It satisfies the condition

|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.

Hence, Sn is cordial graph.

For example, S5 and S6 are cordial graphs as shown in the Figures 2 and 3.
u

u1

1
1

0
0

u2
0

u6

u3

u5
u

Figure 2 Graph S6
u

u1

u5

0
0

u2
0

u3

u4

Figure 3 Graph S5
Theorem 3.3 A bistar Bm,n is a cordial graph.
Proof Let V (Bm,n ) = {(u, v), (ui : 1 i m), (vj : 1 j n)} and E(Bm,n ) = {[(uui ) :
S
S
1 i m] [(vvi ) : 1 i m] [(uv)]}. Define f : V (Bm,n ) {0, 1} by two cases.

Case 1. If m = n, the vertex labeling is defined by f (u) = {0}, f (v) = {1}, f (ui ) = {0, 1
i m}, f (vi ) = {1, 1 i m} with an induced edge labeling f (uui ) = {0, 1 i m},
f (vvi ) = {1, 1 i m} and f (uv) = 0. Here V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ) + 1. It
satisfies the condition
|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.
Case 2. If m < n, the vertex labeling is defined by f (u) = {0}, f (v) = {1}, f (ui ) = {0, 1
i m}, f (vi ) = {1, 1 i m},

1, i 1 mod 2,
f (vm+i ) =
0, i 0 mod 2,

1 i n m,

148

A.Nellai Murugan and P.Iyadurai Selvaraj

with an induced edge labeling f (uui ) = {0, 1 i m}, f (vvj ) = {1, 1 j m}, f (uv) = 0,

1, i 1 mod 2,
f (vvm + i) =
0, i 0 mod 2, 1 i n m.

Here, if n m is odd, then V0 (f ) + 1 = V1 (f ) and E0 (f ) = E1 (f ); if n m is even, then

V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ) + 1. It satisfies the condition
|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.
Case 3. If n < m, by substituting m by n and n by m in Case 2 the result follows.

Hence, Bm,n is a cordial graph.

For example B3,3 , B2,6 and B6,2 are cordial graphs as shown in the Figures 4, 5 and 6.

u1
0

v1

0
0

u2

v2

u3

v3

1
Figure 4 Graph B3,3

v1 1
v2 1

1
0

u1
0
0

1
0

v3 1

v
1

v4 1

u2

0
0

v5 0
v6 0

Figure 5 Graph B2,6

149

Cycle and Armed Cap Cordial Graphs

u1

u2
1

u4

1
0

u5

u6

v2

v1

u3

Figure 6 Graph B6,2

Theorem 3.4 A graph Pm Pn is cordial.
Proof Let G be the graph Pm Pn with V (G) = {[ui : 1 6 i 6 m], [vij : 1 6 i 6 m, 1 6
S
S
j 6 n 1]} and E(G) = {[(ui ui+1 ) : 1 6 i 6 m 1] [(ui vi1 ) : 1 6 i 6 m] [(vij vij+1 ) : 1 6
i 6 m, 1 6 j 6 n 2]}. Define f : V (G) {0, 1} by cases following.
Case 1. If m is even, then the vertex labeling is defined by

0, 1 i m , 1 6 j 6 n 1,
0, 1 i m ,
2
2
f (ui ) =
f (vij ) =
1, m + 1 i m,
1, m + 1 i m, 1 6 j 6 n 1
2
2
with an induced edge labeling

0, 1 i m ,
2
f (ui ui+1 ) =
1, m + 1 i m 1,
2

0, 1 i m ,
2
f (ui vi1 ) =
1, m + 1 i m,
2

0, 1 i m , 1 6 j 6 n 2,
2
f (vij vij+1 ) =
1, m + 1 i m, 1 6 j 6 n 2.
2

Here V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ) + 1. It satisfies the condition

|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.

150

A.Nellai Murugan and P.Iyadurai Selvaraj

Case 2. If m is odd and n is odd, the vertex labeling is defined by

0, 1 i m1 ,
0, t1 i m1 , 1 6 j 6 n 1,
2
2
f (ui ) =
f (vij ) =
1, m+1 i m,
1, m+1 i m, 1 6 j 6 n 1,
2
2

1, 1 j n ,
2
f (v m+1 j ) =
2
0, n + 1 6 j 6 n 1
2

with an induced edge labeling

0, 1 i m1 ,
2
f (ui ui+1 ) =
1, m+1 + 1 i m 1,
2

0, 1 i m1 ,
2
f (ui vi1 ) =
1, m+1 + 1 i m,
2

0, 1 i m1 , 1 6 j 6 n 2,
2
f (vij vij+1 ) =
1, m+3 i m, 1 6 j 6 n 2,
2

1, 1 j n3 ,
2
f (v m+1 j v m+1 j+1 ) =
2
2
0, n1 j 6 n 2.
2

Here V0 (f ) + 1 = V1 (f ) and E0 (f ) = E1 (f ). It satisfies the condition

|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.

Case 3. If m is odd and n is even, the vertex labeling is defined by

0, 1 i m1 , 1 6 j 6 n 1,
0, 1 i m1 ,
2
2
f (ui ) =
f (vij ) =
1, m+1 i m, 1 6 j 6 n 1
1, m+1 i m,
2
2

with an induced edge labeling

0, 1 i m1 ,
2
f (ui ui+1 ) =
1, m+1 + 1 i m 1,
2

0, 1 i m1 ,
2
f (ui vi1 ) =
1, m+1 + 1 i m,
2

0, 1 i m1 , 1 6 j 6 n 2,
2
f (vij vij+1 ) =
1, m+1 i m, 1 6 j 6 n 2,
2

1, 1 j n4 ,
2
f (v m+1 j v m+1 j+1 ) =
2
2
0, n2 j 6 n 2.
2

Here V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ) + 1. It satisfies the condition

|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.

151

Cycle and Armed Cap Cordial Graphs

Hence, the graph Pm Pn is cordial.

For example, P4 P5 , P5 P5 and P5 P6 are cordial as shown in Figures 7, 8 and 9.

u1

u2

u3

u4

v11

v 21

v12

v22

v13

v23

v14

v31

v41

v32

v42

v33

v43

v24

0
0

v34

v44

Figure 7 Graph P4 P5

u1

u2

u3

u4

u5

v11

v 21

v31

v41

0
0

v22

v13

v23

v33

v14

v24

v34

v51

v12

v32

v42

v52

v43

v53

v44

v54

Figure 8 Graph P5 P5
0

u1

u2

u3

u4

u5

0
0

v11

v 21

v31

v32

v13

v14

v23

v33

v24

v34

v15

v25

v35

v41

1
1

v22

0
0

v12
0

v51

v42

v43

v53

1
1

v45

v44

v52

v54

1
1

Figure 9 Graph P5 P6

v55

152

A.Nellai Murugan and P.Iyadurai Selvaraj

Theorem 3.5 A Helm (Cn K1 ) is cordial.

Proof Let G be the graph (Cn K1 ) with V (G) = {ui , vi : 1 6 i 6 m} and E(G) =
{(ui vi ) : 1 6 i 6 m}. A vertex labeling on G is defined by f (ui ) = {1, 1 6 i 6 m}, f (vi ) =
{0, 1 6 i 6 m} with an induced edge labeling f (ui ui+1 ) = {1, 1 6 i 6 m 1}, f (um u1 ) = 1,
f (ui vi ) = {0, 1 6 i 6 m}. Here V0 (f ) = V1 (f ) and E0 (f ) = E1 (f ). It satisfies the condition
|V0 (f ) V1 (f ) | 1 and |E0 (f ) E1 (f ) | 1.

Hence, A Helm is cordial.

For example, a Helm (C6 K1 ) is cordial as shown in the Figure 10.
0

v6
0

v1

1
0

u6

v5

u1

u2

u5
1

v2

0
0

u3

u4

v4

v3

Figure 10 Graph (C6 K1 )

References
[1] J.A.Gallian, A Dynamic Survey of graph labeling, The Electronic journal of Combinatorics,
6(2001), #DS6.
[2] F.Harary, Graph Theory, Addition - Wesley publishing company Inc, USA, 1969.
[3] A.Nellai Murugan and V.Baby Suganya, Cordial labeling of path related splitted graphs,
Indian Journal of Applied Research, Vol.4, Issue 3, Mar. 2014, 1-8.
[4] A.Nellai Murugan and M.Taj Nisha, A study on divisor cordial labelling of star attached
paths and cycles, Indian Journal of Research, Vol.3, Issue 3, Mar. 2014, 12-17.
[5] A.Nellai Murugan and V.Brinda Devi, A study on path related divisor cordial graphs,
International Journal of Scientific Research, Vol.3, Issue 4, April. 2014, 286 - 291.
[6] A.Nellai Murugan and A.Meenakshi Sundari, On Cordial Graphs, International Journal of
Scientific Research, Vol.3, Issue 7, July. 2014, 54-55.
[7] A.Nellai Murugan and P.Iyadurai Selvaraj, Path related cup cordial graphs, Indian Journal
of Applied Research, Vol. 4, Issue 8, August 2014.