ABSTRACT

A divisor cordial labeling of a graph G with vertex set V is a bijection f

from V to {1, 2,... | V |} such that an edge uv is assigned the label 1
if f (u) | f (v) or f (v) | f (u) and the label 0 otherwise, then number of
edges labeled with 0 and thenumber of edges labeled with 1 differ by
at most 1. A graph with a divisor cordial labeling is called a divisor
cordial graph. In this paper we prove that helm H n , flower graph Fln
and Gear graph Gn

are divisor cordial graphs. Moreover we show

that switching of a vertex in cycle Cn , switching of a rim vertex in wheel

Wn and switching of the apex vertex in helm H n admit divisor cordial
labeling.

1. INTRODUCTION
We begin with simple, finite, connected and undirected graph G

(V (G), E(G))

with

p vertices and q edges. For standard terminology and notations related to

graph theory we refer to Gross and Yellen [1] while for number theory
we refer to Burton [2] . We will provide brief summary of definitions and
other information which are necessary for the present investigations.
Definition 1.1. If the vertices are assigned values subject to certain condition(s)
then it is known as graph labeling.
According to Beineke and Hegde [3] graph labeling serves as a
frontier between number

theory

and

structure

of

graphs.

Graph

labelings have enormous applications within mathematics as well as to

several areas of computer science and communication networks.
Yegnanaryanan and Vaidhyanathan [4] have discussed applications of
edge balanced graph labeling, edge magic labeling and (1,1) edge magic
graphs. For a dynamic
survey on various graph labeling problems along with an extensive
bibliography we refer to Gallian [5].
Definition 1.2.
A mapping f :V (G) {0,1} is called binary vertex labeling of

G and

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

Notation 1.3. If for an edge e
{0,1} is given by f * (e)

uv , the induced edge labeling f * : E(G)

| f (u) f (v) | . Then

2

v f (i)

number of vertices of G having label i under f

e f (i)

number of vertices of G having label i under f *

Definition 1.4. A binary vertex labeling f 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.
The above concept was introduced by Cahit [6]. After this many
labeling schemes are also introduced with minor variations in cordial theme.
The product cordial labeling, total product cordial labeling and prime cordial
labeling are among mention a few. The present work is focused on divisor
cordial labeling.
Definition 1.5. A prime
cordial labeling of a graph G with vertex set V (G) is a bijection f

:V (G) {1, 2, 3, ,| V (G) |} and the induced function f * : E(G) {0,1} if gcd( f (u), f
(v))

, otherwise.

which satisfies the condition | e f (0) e f (1) | 1 . A graph which admits prime cordial
labeling is called a prime cordial graph.
The concept of prime cordial labeling was introduced by Sundaram et al. [7] and in
the same paper they have investigated several results on prime cordial labeling.
Vaidya and Vihol [8, 9] as well as Vaidya and Shah [10, 11, 12] have proved
many results on prime cordial labeling.
Motivated through the concept of prime cordial labeling Varatharajan et al. [13]
introduced a new concept called divisor cordial labeling which is a
combination of divisibility of numbers and cordial labelings of graphs.

Definition

1.6.

Let

(V (G), E(G)) be

simple

graph

and

: {1, 2,... |V (G) |} be a bijection. For each edge uv , assign the label 1 if f
(u) | f (v) or f (v) | f (u) and the label 0 otherwise. The function

f is

called a divisor cordial labeling if | e f (0) e f (1) | 1. A graph with divisor

cordialabeliniscalledadivisorcordial.

In [13] authors have proved that path, cycle, wheel, star, K 2,n and K3,n are divisor
cordial graphs while K n is not divisor cordial for n 7 . The divisor cordial
labeling offull binary tree as well as some star related graphs are reported by
Varatharajan et al. [14] while some star and bistar related graphs are proved to
be divisor cordial graphs by Vaidya and Shah [15].It is important to note that
prime cordial labeling and divisor cordial labelng are two independent concepts. A
graph may possess one or both of these properties or neither
as exhibited below.
i) Pn (n 6) is both prime cordial as proved in [7] and divisor cordial as proved in
[13].
ii) C3 is not prime cordial as proved in [7] but it is divisor cordial as
proved in [13]. iii) We found that a 7-regular graph with 12 vertices
admits prime cordial labeling
but does not admit divisor cordial labeling.
iv) Complete graph K7 is not a prime cordial as stated in Gallian [5] and
not divisor cordial as proved in [13].
Definition 1.7. The helm H n

is the graph obtained from a wheel Wn

by

attaching a pendant edge to each rim vertex. It contains three types of vertices:
an apex of degree
n, n vertices of degree 4 and n pendant vertices.
Definition 1.8. The flower Fln is the graph obtained from a helm H n by
joining each pendant vertex to the apex of the helm. It contains three types of
vertices: an apex of degree 2n , n vertices of degree 4 and n vertices of degree 2.
Definition 1.9. Let e=uv be an edge of the graph G and w is not a vertex of G. The
edge e is called subdivided when it is replaced by edges e

uw and e

wv .

Definition 1.10. The gear graph Gn is obtained from the wheel by subdividing
each of its rim edge.
Definition 1.11. A vertex switching Gv of a graph G is the graph obtained by taking a
vertex v of G , removing all the edges incident to v and adding edges jo Bloom has posed a
5

problem at the Graph theory meeting of the New York Academy of Sciences in Nov 1989. He
posed the following question: Is the condition that, k is proper divisor of n sufficient for the cycle
Cn to have a minimal k-equitable labeling? Jerzy Wojciechowski [16] gives positive answer to
this question. He writes if k and m are integers greater than 1 then the cycle C mk is minimally kequitable. He considers two cases (i) when k is odd and (ii) when k is even.A shell of size n is
obtained by taking a cycle of length n and adding exactly (n-3) chords which are concurrent at a
vertex in the initial cycle. This vertex is called apex of the shell. If one-point unions of these
shells are taken then it is called multiple shell. Chitre and Limaye [17] have proved that
multiple shells are 5-equitable.
ining v to every other vertex which are not adjacent to v in G .
Divisor Cordial Labeling of Some Wheel Related Graphs

Theorem 2.1. H n is a divisor cordial graph for every n .

Proof : Let v be the apex, 1v ,v2 ,
,u2 ,

,vn be the vertices of degree1 4 and u

,un be the pendant vertices of H n . Then |V (H n ) |

2n 1 and |

E(H n ) | 3n . We define vertex labeling as f :V (G) {1,2,3,

, 2n 1}

as follows.
f (v)

1, For1 iAssign
that 2 f (v ) i
i

i the labels v and ui such

Now for remaining vertices, vk 1 ,vk 2 ,

f (ui i ) and f (v ) ? f (v 1 ) .

,vn and uk 1 ,uk 2 ,

,un

1
assign the labels such that f (v j ) ? f (v j 1 ) where
k j n 1, f (vn ) ? f (v

) and f (v j ) ? f (u j ) where k

j n .

In view of above labeling pattern we have, e f (1)

2
(0)

3n

. Thus, | e f (0) e f (1) | 1 .

Hence, H n is a divisor cordial graph for each n .

3n

,e f

Theorem 2.3. Fln is a divisor cordial graph for each n .

Proof : Let v be the apex 1 v ,v2 ,

,vn be the vertices of degree 4 and

u1 ,u2 ,

,un

be the vertices of degree 2 of

|V (Fln ) |

2n

1 and | E(Fln ) |

:V (G) {1, 2,3,

f (v)

1,

i )

1} as follows.

3,

2(i 1);

1 i n 1 f (u
4

4n . We define vertex labeling f

f (v )1

2,1 f (u )

f (v

, 2n

Fln . Then

2(i 1);

i )
1 i

n 1
In view of the above labeling pattern we have, e f (0)

2n

e f (1) .

Thus, | e f (0) e f (1) | 1 .

Hence, Fln is a divisor cordial graph for each n .

Example 2.4. Divisor cordial labeling of the graphl F 11 is shown in Figure 2.

Figure 2: Divisor cordial labeling of F 1

Theorem 2.5. Gn is a divisor cordial graph for every n .

Proof: Let Wn be the wheel with apex vertex v and rim1 vertices v
,v2 ,

1
,vn . To obtain the gear graph Gn subdivide each rim edge
of
i

wheel
by the vertices u ,u2 ,
1
and v 1 for i
Then

, n 1and un is added between v

1, 2,

|V (Gn ) |

,un . Where each ui is added between v

2n

and | E(Gn ) |

and

3n .

We

vn

define

vertex
labeling f :V (G) {1,2,3,

, 2n

1}, as follows.

3n
3n
Our aim is to generate edges having label 1 and
edges
2
2

having label 0.

f (v)

1, which generates n edges having label 1.

3n
Now it remains to generate k
n edges with label 1.
2

For the vertices 1 v ,u1 ,v2 ,u2 ,

assign the vertex label as per

following ordered pattern upto it generate k edges with label

where (2m 1)2 km 2n

1 and m 1,km 0 .

Observe that (2m 1)2

| (2m 1)2

1 and (2m 1)2ki does not divide 2m

Then for

remaining vertices of

Gn , assign the vertex label such that the

consecutive vertices do not generate edge label 1.

8

1.

In view of above labeling pattern we have, e f (1)

2

3n

, e f (0)

3n

.
Thus, | e f (0) e f (1) | 1 .

Hence, Gn is a divisor cordial graph for each n .

Example 2.6. Divisor cordial labeling of the graph G20 is shown in

Figure 2: Divisor cordial labeling of G20

3. Switching of a Vertex and Divisor Cordial Labeling

Theorem 3.1. Switching of a vertex in cycle Cn admits divisor cordial labeling.

Proof: Let v 1,v2 ,

,vn be the successive vertices of Cn and Gv denotes graph

obtained by

switching of vertex v of G

Cn . Without loss of generality let the

switched vertex be v . We note that V Gv

1

n and E Gv

2n 5 . We define vertex labeling

:V
1

1 1, 2,

Gv
,n a

s follows: f (v )
f (v

i)

1,

i.

In view of the above labeling pattern we have, e f (1)

n 3,e f (0)

n 2 . Thus, | e f (0) e f (1) | 1 .

Hence, the graph obtained by switching of a vertex in cycle Cn

is a divisor cordial labeling.

Example . The graph obtained by switching of a vertex in cycle

C8 and its divisor cordial labeling is shown in Figure 4.

10

Figure 3: Switching of a vertex in C8 and its divisor cordial labeling

Theorem 3.3. Switching of a rim vertex in a wheel Wn admits

divisor cordial labeling. Proof : Let1 v be the apex vertex and v
,v2 ,
Gv

,vn be the rim vertices of wheel Wn . Let

1

denotes graph obtained by switching of a rim vertex v 1 of G

Wn . We note that V Gv
1

1 and E Gv

3n

6 . To define vertex labeling

f :V Gv
1

1, 2,

,n

1 , we consider

following two cases. Case 1: n

f (v)

1, f (v 1 )

5, f (v2 )

2, f (v3 )

3, f (v4 )

4 . Then e f (0)

(1) .
Case 2: n 5
f (v)

2,

f (v ) 1 1 ,

f (v2 )

3,

f (v3 )

6 , f (v4 )

4,

f (v5 )
11

5,

ef

f (v5 i )

1 i n 5

i;

In view of the above defined labeling pattern for case 2,

3n 6

If n is even then e f (0)

3n 6

(0)

e f (1) , otherwise
2e f

e f (1) 1. Thus in both the cases we

have, | e f (0) e f (1) | 1 .

Hence, the graph obtained by switching of a rim vertex in a wheel

Wn is a divisor cordial labeling.
Example 3.4. The graph obtained by switching of a rim vertex in
the wheel W9 and its divisor cordial labeling is shown in Figure 5.
Figure 5: Switching of a rim vertex in W9 and its divisor cordial labeling
Theorem 3.5. Switching of the apex vertex in helm H n admits
1

divisor cordial labeling. Proof: Let v be the apex, v , v2 ,

the vertices of degree 4 and u1 ,u2 ,

,vn be

,un be the

pendant vertices of H n . Let Gv denotes graph obtained by switching of an apex

vertex
v of G

H n . We note that V Gv

2n

1 and E Gv
1

define vertex labeling

f :V G 1 1,2,

, 2n

3n

Our aim is to generate

2
3n

edges having label 0.

1 as follows:

f (v)

edges having label

1 and
2

1, which generates n edges

having label

12

3n .

We

Now it remains to generate k

For the vertices v 1,v2 ,

3n

n edges with label 1.

,vl assign the vertex label as per following

ordered pattern upto it generate k edges with label

where (2m 1)2km 2n

1and m 1, k m 0 .

Observe that (2m 1)2

| (2m 1)2

divide 2m

1 and (2m 1)2ki

does not

1.

Then for remaining vertices vl 1 ,vl 2 ,

,vn and u1 ,u2 ,

,un

assign the vertex label such that no edge label generate 1.

In view of above labeling pattern we have, e f (1)

2

3n

, e f (0)

| e f (0) e f (1) | 1.

Hence, the graph obtained by switching of the apex vertex in helm

H n admits divisor cordial labeling.
Example 3.6. The graph obtained by switching of the apex vertex in
helm H11 and its divisor cordial labeling is shown in Figure 6.

13

Figure 4: Switching of the apex vertex in H11 and its divisor cordial labeling

4. Concluding Remarks

The divisor cordial labeling is a variant of cordial labeling. It is

very interesting to investigate graph or graph families which are
divisor cordial as all the graphs do not admit divisor cordial labeling.
Here it has been proved that helm H n , flower graph Fln and Gear
graph Gn are divisor cordial graphs. The graphs Cn and Wn are
proved to be divisor cordial graphs by Varatharajan et al. [13] while
we prove the graphs obtained by switching of a vertex in Cn ,
switching of a rim vertex in Wn and switching of the apex vertex in
H n are divisor cordial graphs. Hence Cn , Wn and H n are
switching invariant graphs for divisor cordial labeling.
Acknowledgement:

The authors are highly thankful to the

anonymous referee for kind comments and constructive suggestions.

14

Review of Literature

Harmonious and Feliticious Labeling.

Corona graphs Cn*K1 are highly symmetrical graphs. They are unicyclic graphs. Cyclerelated graphs are of major importance for labeling. Some labelings are already defined
for unicyclic graphs. Rosa [1] showed that Cn is graceful if and only if n 0 or 3 (mod 4).
Graham and Sloane [2] proved that Cn is harmonious if and only if n 1 or 3 (mod 4).
Lee, Schmeichel and.Shee [3] give some necessary conditions for a graph to be
feliticious. The generalization of harmonious graph is feliticious graph is shown. They
show that some families of graph like cycles of order 4k, complete bipartite graphs,
generalized Petersen graphs etc. are feliticious while some graphs like cycles of order
4k+2, complete graph Kn when n 5 are not feliticious.

Cordial labeling and Divisor cordial labeling

Cahit [4] introduced a new vertex labeling for graphs called cordial labeling. He has
proved the results of cordial labeling on trees. The cordial labeling of corona Cn*K1 is not
yet undertaken.

The 2-equitable graphs were called cordial graphs by Cahit [5]. He has shown that the
cycle Cn with n-vertices is 3-equitable iff n 3 (mod 6). The k-angular cactus, Tk,t, is a
connected graph whose all blocks are cycles with k-vertices. Cahit showed that Tk,t is
cordial iff k.t 2 (mod 4).

Some special classes of graphs such as dragon, corona, wheel, full binary trees, G*K2,n
15

and G*K3,n are shown to be divisor cordial by Varatharajan at. el. [6]

Graceful labeling

Christian Barrientos [7] defines difference vertex labelings and shows that any forest
whose components are caterpillars is odd-graceful. He also shows that every tree of
diameter up to 5 is odd graceful. A caterpillar can also be obtained from Cn*K1, by
removing a edge from cycle Cn.
In [8] Elumalai and Sethvroman proves that every n cycle (n 6) with parallel chords is
graceful for all n 6 and every n-cycle with parallel Pk
chords of increasing lengths is graceful for n 2 (mod 4) with 1 k [

-1 .

Andrea Vietri [9] exhibits a graceful labeling for generalized Petersen graph
P8t,3 with t 1. As a consequence for any fixed t, a cyclic edge-decomposition of
complete graph K48t+1 into copies of P8t,3 is obtained. Due to its extreme versatility this
technique is used for finding new graceful labeling notnecessarily involving generalized
Petersen graphs.

Ramfrez-Alfonsin [10] has showed that all caterpillars are graceful. Further he shows
that Replicated Cycles Rx (Cn) i.e. the cycle with n vertices is graceful iff n = 0 or 3 (mod
4).
Kathieresan [11] have proved the gracefulness of new class of graphs denoted by Kn*S2n1

He also prove that the graphs consisting of 2m+1 internally disjoint path of length

2r each, connecting two fixed vertices are also graceful.

Christian Barrientos [12] studied graceful labeling of some graphs that result of two
16

different constructions. The first construction produces chains graphs. It is shown that
chain graph is graceful if any graph in the chain has -labeling. The second construction
is the corona graph Cn*nK1. It is shown that corona graph Cn*nK1 is graceful for every
positive integer n 3 & m 1.

Redl [13] has given two mathematical programming formulations of the graceful labeling
problem. He has given new results on the gracefulness of three classes of graphs i.e.
generalized Petersen graphs P(n,k), double cones Cn +

and product graphs of form

Kn*Pn.

The study of graceful labeling of graphs with pendant edges is given by Christian
Barrientos [14]. In particular graceful labeling for graphs of the form G*nK1 and G +
nK1 when G is a graceful graph with order greater than its size is given. He has also
shown a graceful labeling of unicyclic graph formed by a cycle with any no. of pendant
edges attached.

17

Equitability

Minimal k-equitability of C2n*K1 ; k = 2, 2n and associated graphs were dealt with by

Manisha Acharya and Bhat Nayak. [15]. They proved that C2n*K1,
are minimally k-equitable for k = 2, 2n and that C2n+1*K1 are minimally (2n+1) equitable. Further they showed minimal 2-equitability of graphs that are

obtained by removing any set of rays from a certain part of the corona graphs C2n*K1.
Bloom has posed a problem at the Graph theory meeting of the New York Academy of
Sciences in Nov 1989. He posed the following question: Is the condition that, k is proper
divisor of n sufficient for the cycle Cn to have a minimal k-equitable labeling? Jerzy
Wojciechowski [16] gives positive answer to this question. He writes if k and m are
integers greater than 1 then the cycle Cmk is minimally k-equitable. He considers two
cases (i) when k is odd and (ii) when k is even.A shell of size n is obtained by taking a
cycle of length n and adding exactly (n-3) chords which are concurrent at a vertex in the
initial cycle. This vertex is called apex of the shell. If one-point unions of these shells are
taken then it is called multiple shell. Chitre and Limaye [17] have proved that multiple
shells are 5-equitable.

Christian Barrientos [18] proves that the corona graph Cn*K1 is equitable. He further
shows that corona Cm*nK1 is k-equitable for some values of k, m and n. For every proper
divisor k of 2n the corona Cn*K1 is k-equitable is shown in [18]. The corona C3*nK1 is
complete 3-equitable graph for every positive value of n. If n is odd then corona C3*nK1
is complete 2-equitable graph. These coronas can be further checked for the parameters k,
18

m and n.
k-equitable labeling of complete bipartite graph and multibipartite graph is shown by
David Vickrey [19]. He considers k-equitable labeling and shows that K(m,n) is not kequitable if m+ n k mn . Also if 0 t k-m and s = 0 then K(m,n) is k-equitable iff k
> mn. He further generalizes that for the bipartite graph K(m,n) ; m,n 3, k 3, the only
graphs which are k-equitable are K4,4 for k = 3 ; K(3,k-1)

k and K(m,n) for k > mn.

Adidarma Sepang et al [25] have constructed new super edge magic total labeling of
special classes of unicyclic graphs. This construction is taken from super edge magic total
labeling of odd cycles. The authors have shown that all cycle-like unicylics are super edge
magic total graph. Further they prove that all coronas like unicycles are super edge magic
total graph.

Prime labeling of certain classes of graphs are discussed by Ramya, Rangarajan and
Sattanathan [26]. They show that H-graph which is a 3 regular graph satisfy prime
labeling. A Gear graph is obtained from wheel graph. They have shown that gear graph
satisfy prime labeling. The corona Cn*K1,3 and sunflower graph also satisfy the prime
labeling is shown with stepwise algorit Lai and Chang [27] studies profile of the corona
G^H of two graphs G and H. The exact value of the profile of corona G^H are obtained
when G has certain properties, including when G is a caterpillar, a complete graph or a
cycle. They have shown that if Cn is a cycle of n vertices and H is a graph on M vertices
then P(Cn) = 2n-3 and M (Cn) = 2n-2 Also P(Cn^H) = P(Cn) +n P(H) + M (Cn)m = 2n3+nP(H) + (2n-2)m.

It is shown by Hungund and Akka [28] that the corona of an odd cycle Cn on K2 admits
super edge magic-labelings and reverse super edge magic-labeling]. Further they have
obtained super edge-magic strength as well as reverse super edge-magic strength of
Cn*K2 for all odd n3.
Solairaju and Muruganantham [29] showed even vertex graceful of path, circuit, star,
19

wheel and some extension friendship graphs and helm graph.

Solairaju, Vimala and Sasikala [30] showed edge-odd gracefulness of graphs S2Sn
which is book graph. It is connected graph obtained by adding n number of Cn with one
edge. It has 2n vertices and 3n-2 edges.
Application

One of the applications of labeling in graph theory itself is seen in the paper by
Mickal Montassier and Andre Raspaud [31]. The (d,1) - total number Td
(G) of a graph G is the width of the smallest range of integers that suffices to label the
vertices and the edges of G so that no two adjacent vertices have the same color, no two
incident edges have the same color and the distance between the color of a vertex and its
incident edges is at least d. The authors have proved that Td (G) (G) +2d-2 for
connected graphs with a given maximum average degree.
Denise Sakai [32] has shown that for chordal graphs G, with maximum degree G, (a)
((a)+3)2/4. In particular if G is a unit interval graph with dramatic number (a), (a) 2
(a) which is better bound. He have shown that conjecture (a) 2(a) by[33] Griggs and
Yeh [SIAM J. Discrete Mathematics, 5 (1992) pp 586-595] is true for chordal graphs.
(a) is minimum range of labels over all distinct labeling.

vertex coloring of graph is an assignment of colors to the vertices of G such that every
two adjacent vertices of a have different colors. Several mathematical properties related to
coloring, domination and location of corona graphs is studied by Gonzalez et al[34].
They have given exact value of the distance k-chromatic number of the corona of a path
and an arbitrary graph.

Robin W. Whitty [35] shows that there is close connection of Mobis band and Klein
Bottle to graceful labeling of graphs. If B(a) is incidence matrix for Klein bottle then
Robin Whitty [35] gives matrix tree theorem as Any row and column deleted minor of
20

B(G).B(G)T has determinant whose absolute value equals the number of spanning trees of
G.

Jianxiu [36] discusses the cyclic bandwidth sum problem which is to determine a
labeling of graph G in a cycle such that the total length of edges is as small as possible.
Some upper bounds on cyclic bandwidth sum of graphs are studied.
Akbari et al [37] have proved that for every graph G with 2, m (G) 2 - + 1
where denotes maximum degree of G. They also show that for every 3 list assignment
to the vertices of a forest there is a list lucky labeling which is a proper vertex coloring
too.

Ramya, Rangarajan and Sattanathan [38] have shown rainbow coloring of the corona
of PnoK2, the corona of PnoC4, flower graphs and fan graphs. The rainbow connectivity of
graph G denoted as rc(G) is the smallest number of colors required to edge color the
graph such that the graph is rainbow connected. They further find rc (G) of the graphs
given above.

Not much research is done on labeling of corona graphs Cn*K1. It is almost side tracked.
Different labeling techniques are there but not many are applied to Cn*K1. Hereby
different labeling techniques will be applied to graphs Cn*K1. The range of parameter for
n, k, p and q will be found.All graphs considered here are finite, simple and undirected.
The origin of graph labelings can be attributed to Rosa [7]. For all terminologies and
notations we follow Harary [5]. Following definitions are useful for the present study.

Definition 1.1. [8] For each vertex v of a graph G, take a new vertex v . Join v to all the
vertices of G adjacent to v. The graph S(G) thus obtained is called splitting graph of G.
Definition 1.2. [9] The graph G = K1(,n1):K1(,n2 ):...:K1(k),n is obtained from k copies of
stars K1(,n1) ,K1(,n2 ) ,...,K1(k),n by joining apex vertices of each K1(p,n 1 ) and K1(p),n to a new
21

vertex xp1, 2 p k.

Note that G has k(n + 2) 1 vertices and k(n + 2) 2 edges.

Definition 1.3. The assignment of values subject to certain conditions to the vertices of a
graph is known as graph labeling.
Definition 1.4. Let G = (V, E) be a graph. A mapping f : V(G) {0,1} is called binary
vertex labeling of G and f(v) is called the label of the vertex v of G under f.
For an edge e = uv, the induced edge labeling f : E(G) {0,1} is given by f (e) =
|f(u) f(v)|. Let vf(0), vf(1) be the number of vertices of G having labels 0 and 1
respectively under f and let ef(0), ef(1) be the number of edges having labels 0 and 1
respectively under f .

Definition 1.5. A binary vertex labeling of a graph G is called a cordial labeling if | vf(0)
vf(1) | 1 and | ef(0) ef(1) | 1. A graph G is cordial if it admits cordial
labeling.
Definition 1.6. A wheel graph Wn is obtained from a cycle Cn by adding a new vertex and
joining it to all the vertices of the cycle by an edge, the new edges are called the spokes of
the wheel.
Definition 1.7. A fan graph Fn is obtained from a path Pn by adding a new vertex and
joining it to all the vertices of the path by an edge, the new edges are called the spokes of
the fan.
Definition 1.8. A matching graph Mn is n copies of K2.
The concept of cordial labeling was introduced by Cahit [3]. S.M. Lee and A. Liu [6]
proved that all complete bipartite graphs and all fans are cordial. Further, they
proved that, the cycle Cn is cordial if and only if n2 (mod 4), the matching Mn is
22

cordial if and only if n2 (mod 4) and the wheel Wn is cordial if and only if n
3 (mod 4), n

3. S.K. Vaidya et al.[9]

K(1) : K(2) : ... : K(k) is cordial.

proved

1,
1,n 1,n

In this paper, we prove that the splitting graph of path Pn, cycle Cn, complete
bipartite

graph

Km,n,

matching

Mn, Wn

wheel

ar

and

K(1)

: K(2)

(k)

: ... : K

1,n

MAIN RESULTS
Theorem 2.1. The graph S(Pn ) is cordial.
Proof. Let G be Pn. The vertices of Pn are v1,v2,,vn. Then S(G) has the vertices
v1,v2,,vn,v1 ,v2 ,,vn . The vertex labeling f : V(S(G)) {0,1} is given below.
1

if i 0, 1 (mod 4)

if i

2, 3 (mod 4)

if i

2, 3 (mod 4)

if i 0, 1 (mod 4)

f(vi )

f(vi )
vf(0) = vf(1) for all n and ef(0) = ef(1) + 1 if n is even and
ef(0) = ef(1) if n is odd.
Therefore

grap

the

S(G) satisfies the conditions | vf(0) vf(1) |1 and

| ef(0) ef(1) | 1.
Hence

S(Pn

is

cordial.
23

Illustration 2.2. The cordial labelings of S(P4) and S(P5) are shown in Figure 1(a)
and 1(b).
0

(a)

(b)

Figure 6: Cordial labelings of S(P4) and

S(P5)
Theorem 2.3. The graph S(Cn ) is cordial
for n

2 (mod 4), n 3.

Proof. Let G be Cn (n 3). The vertices of Cn are v1,v2,,vn. Then S(G) has the vertices
v1,v2,,vn, v1 ,v2 ,,vn . The vertex labeling f: V(S(G)) {0,1} is given below.
f(vi) = 0 and f(vi ) =
1

if i

2, 3 (mod 4),

if i

0, 1 (mod 4).

f(vi) = 1 and f(vi ) =

0
The
table

following

that

the

graph

S(G)

satisfies

shows conditions

|vf(0)vf(1)| 1 and | ef(0)ef(1)| 1.

Vertex Conditions

Edge Conditions
24

the

n 0 (mod 4)

vf(0) = vf(1)

ef(0) = ef(1)

n is odd

vf(0) = vf(1)

ef(1) = ef(0) + 1

Hence

S(Cn

is

cordial.

Illustration 2.4. The cordial labelings of S(C4) and S(C5) are shown in Figure 2 (a)and
2(b).

Figure 2: Cordial labelings of S(C4) and S(C5)

Theorem 2.5. The graph S(Wn ) is cordial for n

2 (mod 4), n 3.

Proof. Let G be Wn (n 3). The vertices are c,v1,v2,,vn. Then S(G) has the vertices
c,v1,v2,,vn,c ,v1 ,v2 ,,vn . The vertex labeling f : V(S(G)) {0,1} is given below.
f(c) = 0 and f(c ) = 1

Case (i) n 0 (mod 4)

f(vi) = f(vi ) = if
1

1, 2 (mod

0, 3 (mod

4),

f(vi) = f(vi ) = if
0
Case (ii) n

4).
1 (mod

4)
f(vi) = 0

if i 2, 3 (mod 4),

f(vi) = 1

if i 0, 1 (mod 4),

f(vi ) = 1

for i = 1 to (n1)/2,
25

26

Case (iii) n 3 (mod 4)

f(vi) = 0

if i 2, 3 (mod 4),

f(vi) = 1

if i 0, 1 (mod 4),

f(vi ) = 0

for i = 1 to (n1)/2,

f(vi ) = 1

for i = (n+1)/2 to n.

The

following shows

table

that

the S(G)

graph

satisfies

conditions

|vf(0)vf(1)| 1 and | ef(0)ef(1)| 1.

Vertex Conditions

Edge Conditions

n 0 (mod 4)

vf(0) = vf(1)

ef(0) = ef(1)

n 1 (mod 4)

vf(0) = vf(1)

ef(1) = ef(0)

n 3 (mod 4)

vf(0) = vf(1)

ef(0) = ef(1)

27

the

f(vi) = 1

if i 3 (mod 4),

f(vi ) = 1

if i 0, 1, 2 (mod 4),

f(vi ) = 0

if i 3 (mod 4).

S(G)

satisfies

the

The following table shows that the graph conditions

|vf(0)vf(1)| 1 and | ef(0)ef(1)| 1.

Vertex Conditions

Edge Conditions

n is odd

vf(0) = vf(1)

ef(1) = ef(0) + 1

n is even

vf(0) = vf(1)

ef(0) = ef(1)

Hence S(Mn ) is cordial.

Illustration 2.8. The cordial labelings of S(M3) and S(M4) are shown in Figure 4(a)
and 4(b).

28

(b)

(a)

Figure 7: Cordial labelings of S(M3) and

S(M4)
Theorem 2.9. The graph S(Fn ) is cordial for n 2.
Proof. Let G be Fn (n 2). The vertices are c,v1,v2,,vn. Then S(G) has the vertices
c,v1,v2,,vn, c ,v1 ,v2 ,,vn . The vertex labeling f : V(S(G)) {0,1} is given below.
f(c) = 1 and f(c ) = 0

f(vi) = 0 and f(vi ) = 1 for i = 1 to n.

The graph S(G) satisfies the conditions |vf(0)vf(1)| 1 and |ef(0)ef(1)|
since vf(0) = vf(1) and ef(0) = ef(1) + 1 for n 2.
Hence S(Fn ) is cordial for n 2.

29

Illustration 2.10. The cordial labelings of S(F4) and S(F5) are shown in Figure 5(a) and
5(b)

0
1

a)
Figure 8: Cordial labelings of S(F4) and S(F5)
Theorem 2.11. The graph S(Km,n ) is cordial for any m, n N.
Proof. Let G be Km,n. Denote the vertices of Km,n as v1,v2,,vm and u1,u2,,un. Then
S(G) has the vertices v1,v2,,vm,v1 ,v2 ,,vm , u1,u2,,un,u1 ,u2 ,,un . The vertex
labeling f : V(S(G)) {0,1} is given below.

f(vi) = f(ui) =
1

and

f(vi ) = f(ui ) = 0

f(vi) = f(ui) =

f(vi ) = f(ui ) = 1

if

The
following

and

shows

if i is odd.

i is even.
that

the

table graph

the
S(G) satisfies conditions

|vf(0)vf(1)| 1 and | ef(0)ef(1)| 1.

30

Vertex Conditions Edge Conditions

odd

vf(0) = vf(1)

ef(1) = ef(0) + 1

odd

vf(0) = vf(1)

ef(1) = ef(0) + 1

vf(0) = vf(1)

ef(1) = ef(0) + 1

m = n and odd

ef(0)
others

vf(0) = vf(1)

ef(1)

Hence S(Km,n ) is cordial.

Illustration 2.12. The cordial labelings of S(K2,3) and S(K3,3) are shown in
Figure
6(a) and 6(b).

(a)

(b) 1

Figure 9: Cordial 31abeling of S(K2,3) and S(K3,3)

Theorem 2.13. The graph S( K1(,n1):K1(,n2 )::K1(k),n

Proof. Let G be K1(,n1):K1(,n2 )::K1(k),n

) is cordial.

. Let K1(i),n , i = 1,2,..,k be copies of K1,n . Let

vij
be the pendant vertices of K1(i),n and ci be the apex vertex of K1(i),n (i = 1,2,..,k and j
=
1,2,.., n) and x1, x2,, xn1 be vertices such that ci1

31

and ci are adjacent to xi1,

where
2 i k.
has the vertices vij, vij , ci, ci , xi1 and xi1 vertices,
Now S(G)

where

i = 1,2,..,k and j = 1,2,..,n. The vertex labeling f : V(S(G)) {0,1} is given below. For i =
1,2,..,k
f(vij) = 1 and f(vij ) =
0

if

j is odd,

if

j is even,

if

i is odd,

if

i is even,

f(vij) = 0 and f(vij ) =

1
f(ci) = 1 and f(ci ) =
0
f(ci) = 0 and f(ci ) =
1

f(xi) = 1 and f(xi ) = 0 for i = 1 to n.

The

graph

satisfies

S(G)
the conditions | vf(0) vf(1) |1 and

| ef(0) ef(1) | 1 since vf(0) = vf(1) for all n and k and ef(1) = ef(0) +1 if n and k are odd,
others ef(0) = ef(1) .

HenceS( K1(

1)
( 2)
(k)
,n :K1 ,n ::K1 ,n

) is cordial.

K1(,13): K1(,23 ):K1(,33 ))

32

Fig 10 and 11

33

divisor cordial labeling of a graph G with vertex set V is a bijec-tion f from

V to {1, 2, . . . , | V |} such that if each edge uv is assigned the label 1 if
f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of
edges labeled with 0 and the number of edges la-beled with 1 differ by at
most 1. If a graph has a divisor cordial labeling, then it is called divisor
cordial graph. In this paper, we proved some special classes of graphs such
as dragon, corona, wheel, full binary trees, G K2,n and G K3,n are divisor
cordial.

Keywords: Cordial labeling, divisor cordial labeling, divisor cordial graphs

By a graph, we mean a finite, undirected graph without loops and multiple edges,
for terms not defined here,
Main Results

Sundaram, Ponraj and Somasundaram [6] have introduced the notion of prime
cordial labeling.

Definition 2.1. [6] A prime cordial labeling of a graph G with vertex set V is

a bijection f from V to {1, 2, . . . , |V |}

such that if each edge uv assigned the

label 1 if gcd(f(u), f(v)) = 1 and 0 if

gcd(f(u), f(v)) > 1 , then the number

of edges labeled with 1 and the number of edges labeled with 0 differ by at most

First we give the some concepts in Number Theory [3].

Definition 1.1. Let a and b be two integers. If a divides b means that there is a positive
integer k such that b = ka . It is denoted by a | b .
34

If a does not divide b , then we denote a - b .

Graph labeling [4] is a strong communication between Number theory [3] and
structure of graphs [5]. By combining the divisibility concept in Number theory and
Cordial labeling concept in Graph labeling, we introduced a new concept called divisor
cordial labeling [8]. In paper[8], we proved the standard graphs such as path, cycle,
wheel, star and some complete bipartite graphs are divisor cordial and complete graph
is not divisor cordial. In this paper we are going to prove some special classes of graphs
such as full binary trees, dragon, corona, wheel, G K2,n and G K3,n are divisor
cordial.

A vertex labeling [4] of a graph G is an assignment f of labels to the vertices of G

that induces for each edge uv a label depending on the vertex label f(u) and f(v) . The
two best known labeling methods are called graceful and harmonious labelings. Cordial
labeling is a variation of both graceful and harmonious labelings [1].
Definition 1.2. Let G = (V, E) be a graph. A mapping f : V (G) {0,1} is called binary
vertex labeling of G and f(v) is called the label of the vertex v of G under f .
For an edge e = uv , the induced edge labeling f : E(G)

0,1 is given
{

by f(e)= |f(u) f(v)|. Let vf (0), vf (1)

be the number of vertices of G

having labels 0 and 1 respectively under f

and ef (0), ef (1) be the number

of edges having labels 0 and 1 respectively under f .

The concept of cordial labeling was introduced by Cahit [1]
Definition 1.3. A binary vertex labeling of a graph labeling if |vf (0) vf (1)| 1 and |ef
(0) ef (1)| 1 . if it admits cordial labeling.Cahit proved some results in [2].

35

Let V = V1 V2 be the bipartition of K2,n such that V1 = {x1, x2} and V2 = {y1,
y2, . . . yn}. Now assign the labels m + 1, m + 2, . . . m + n to the vertices y1, y2, . . . , yn
respectively.
Then the multiples of p are not available in the labels of yi (1 i n) . Then we see that
the edges of K2,n incident with the vertex vk have the label 1 and with the vertex vl have
the label 0. Thus the edges of K2,n contribute equal numbers namely n to both ef (1) and
ef (0) in GK2,n . Hence GK2,n is divisor cordial
Then the multiples of p are not available in the labels of yi (1 i n) . Then we see that
the edges of K3,n incident with the vertex vk have the label 1 and with the vertex vr have
the label 0. Since n divides only even numbers

36

In [6], they have proved some graphs are prime cordial.

Motivated by the concept of prime cordial labeling, we introduced a new special

type of cordial labeling called divisor cordial labeling as follows.
Definition 2.2. [8] Let G = (V, E) be a simple graph and f : V {1, 2,

. . . |V |} be a bijection. For each edge uv , assign the label 1 if either f(u) | f(v) or f(v) |
f(u) and the label 0 if f(u) - f(v) . f is called a divisor cordial la-beling if |ef (0) ef (1)|
1.

A graph with a divisor cordial labeling is called a divisor cordial graph.

Example 2.3. Consider the following graph G .

1
1

Fig 12 We
see that ef (0) = 3 and ef (1) = 4.
Thus |ef (0) ef (1)|=1 and hence G is divisor cordial.
In this paper we prove some special classes of graphs are divisor cordial.

37

Theorem 2.4. Given a positive integer n , there is a divisor cordial graph

G which has n vertices.

Proof. Suppose n is even.
n + 2 vertices v1, v2, . . . , vn +2 which are

Construct a path containing

labeled as 1, 2, . . . , + 2 respectively. Note that the label of the edge v1v2

is

2
1 and the other edges v

(2

i i+1

+ 1) have the labels 0.

,...,
2 vertices vn

Attach

, vn

which are labeled as

+3, . . . n

+3

24

2 n

respectively, to the vertex v1 . We see that the labels of the edges v1vi(
i n) are 1.

vn +1 vn
2 0 2

v1 1 v2 0 v3 0
1

2 3 4

1
1
vn +3

1
vn

+4

vn

2
n

+3

+4

n
Fig
13

38

+2

+ 1 n2 + 2

+3

So, we have

ef (0) = n2 and ef (1) = 1 + n2 2 = n2 1 and hence

|ef (0) ef (1)| 1. Thus, the resultant graph G is divisor cordial., Similarly,
we can construct a graph for n is odd.
Theorem 2.5. If G is a divisor cordial graph of even size, then G e is also divisor
cordial for all e E(G) .

Proof. Let q be the even size of the divisor cordial graph G . Then it follows that e f (0)
= ef (1) = 2q . Let e be any edge in G which is labeled either 0 or 1. Then in G e , we
have either ef (0) = ef (1) + 1 or ef (1) = ef (0) + 1 and hence |ef (0) ef (1)| 1 . Thus G
e is divisor cordial.
Theorem 2.6. If G is a divisor cordial graph of odd size, then G e is also divisor
cordial for some e E(G) .

Proof. Let q be the odd size of the divisor cordial graph G . Then it follows that either ef
(0) = ef (1) + 1 or ef (1) = ef (0) + 1 . If ef (0) = ef (1) + 1 then remove the edge e which
is labeled as 0 and if ef (1) = ef (0) + 1 then remove the edge e which is labeled 1 from
G . Then it follows that ef (0) = ef (1) . Thus G e is divisor cordial for some e E(G) .

Note 2.7. Similarly we can prove for the divisor cordiality of G + e .

Definition 2.8. An ordered rooted tree is a binary tree if each vertex has atmost two
children.

Definition 2.9. A full binary tree is a binary tree inwhich each internal vertex has
exactly two children.

Next we will prove that a full binary tree is divisor cordial.

Theorem 2.10. Every full binary tree is divisor cordial.

39

Proof. We note that every full binary tree has odd number of vertices and hence has
even number of edges.

Let T be a full binary tree and let v be a root of T which is called zero level vertex.
Clearly, the ith level of T has 2i vertices. If T has m levels, then the number of vertices
of T is 2m+1 1 and the number of edges is 2m+1 .

Now assign the label 2 to the root v and assign the labels 3 and 1 to the first level
vertices. Next, we assign the labels 2i, 2i + 1, . . . , 2i+1 1 to the ith level vertices for 2 6
i6m
In zeroth, first and second levels, we have ef (0) = ef (1) = 3 . Clearly, 2i + j |
2i+1 + 2j for 0 6 j 6 2i 2 and
2i + j - 2i+1 + 2j 1 for 1 6 j 6 2i 1 . Then after the second levels, we have ef (0) =
ef (1) = 2m 3 .
Thus |ef (0) ef (1)| = 0 and hence T is divisor cordial.

40

The next example shows that the divisor cordiality of full binary tree upto 4 levels.

Example 2.11. Here we see that ef (0) = ef (1) = 15.

2
1

0
3
0

1
0

1
5

7
0

1 0

9 10

16 17 18

01

11

0 1

19 20 21 22

12

13 14

0 1

23 24

25 26 27 28

15

0 1

29 30

31

Fig 15

Theorem 2.12. Let G be any divisor cordial graph of size m and K2,n be a bipartite
graph with the bipartition V = V1 V2 with V1 = {x1, x2} and V2 = {y1, y2, . . . yn}.
Then the graph G K2,n obtained by identifying the
vertices x1 and x2 of K2,n with that labeled 1 and the largest prime number
p such that p m respectively in G is also divisor cordial.
Proof. Let G be any divisor cordial graph of size m . Let vk and vl be the
vertices having the labels 1 and the largest prime number namely p such that p m .

41

Let V = V1 V2 be the bipartition of K2,n such that V1 = {x1, x2} and V2 = {y1,
y2, . . . yn}. Now assign the labels m + 1, m + 2, . . . m + n to the vertices y1, y2, . . . , yn
respectively.
Now identify the vertices x1 and x2 of K2,n with that labeled 1 and the largest
prime number p such that p m respectively in G .
Case (i) p < m + n < 2p
Then the multiples of p are not available in the labels of yi (1 i n) . Then we
see that the edges of K2,n incident with the vertex vk have the label 1 and with the vertex
vl have the label 0. Thus the edges of K2,n contribute equal numbers namely n to both ef
(1) and ef (0) in GK2,n . Hence GK2,n is divisor cordial.
Case (ii) m + n 2p .

42

Let q be the largest prime number such that

labeled to some yi . Then interchange the labels of vl

q m + n which is
and yi , that is p and

q . We observe that the largest prime number q does not divide the labels of y1, y2, . . . ,
yn . So, again the edges of K2,n incident with the vertex vl have the labels 0 and hence G
K2,n is divisor cordial.

The following example explains the construction developed in the Theorem 2.12.

Example 2.13. Consider the following graph G .

Here ef (0) = 4 and ef (1) = 3 and hence |ef (0) ef (1)|= 1. Thus G is divisor cordial.
Case(i): Now consider the bipartite graph K2,3 . Then the graph G K2,3 and its labels
are gives as follows.

43

3
6
0
0

0
0

5
1

1 1 1

0
7

Fig 5

Fig 16

44

Here ef (0) = 7 and ef (1) = 6 and |ef (0) ef (1)|=1. Thus GK2,3 is divisor cordial.
Case (ii): Now consider the bipartite graph K2,5 . The graph G K2,5 and its labels are
given as follows.
.

45

3
0

0
1

2
0
1

0
1

11

1
1

0
1

0 0

1
5
7

10

Fig 17

Here we interchanged the labels 5 and 11 and ef (0) = 9 and ef (1) =8 and so |ef
(0) ef (1)|=1
Thus G K2,5 is divisor cordial.

Theorem 2.14. Let G be any divisor cordial graph of size m and K3,n be
a bipartite graph with the bipartition V = V 1 V2 with

V1 = {x1, x2, x3} and

V2 = {y1, y2, . . . yn}, where n is even. Then the graph

G K3,n obtained by

identifying the vertices x1 , x2 and x3 of K3,n with that labeled 1, labeled 2 and the
largest prime number p such that p m respectively in G is also divisor cordiaProof.
Let G be any divisor cordial graph of size m . Then |ef (0) ef (1)| 1 . Let vk , vl and vr
46

be the vertices having the labels 1, 2 and the largest prime number namely p such that p
m.
Let V = V1 V2 be the bipartition of K3,n such that V1 = {x1, x2, x3} and V2 =
{y1, y2, . . . yn}. Now assign the labels m + 1, m + 2, . . . m + n to the vertices y1, y2, . . .
, yn respectively.
Now identify the vertices x1 , x2 and x3 of K3,n with that labeled 1, labeled 2 and
and the largest prime number p such that p m respectively in G .

Case (i) p < m + n < 2p

Then the multiples of p are not available in the labels of yi (1 i n) . Then we
see that the edges of K3,n incident with the vertex vk have the label 1 and with the vertex
vr have the label 0. Since n divides only even numbers,
n2 edges of K3,n incident with the vertex vl

have the label 1 and remaining

n edges have the label 0. Thus the edges of

K3,n contribute equal numbers

2
namely 32n to both ef (1) and ef (0) in G K3,n . Hence G K3,n is divisor cordial.
Case (ii) m + n 2p .
Let q be the largest prime number such that q m + n which is labeled to some
yi . Then interchange the labels of vr and yi , that is p and q . We observe that the largest
prime number q does not divide the labels of y1, y2, . . . , yn . So, again the edges of K3,n
incident with the vertex vr have the labels 0 and hence G K3,n is divisor cordial.

Note 2.15. Theorem 2.14 is also valid for m is even and n is odd. If both m and n are
odd, the above labeling pattern is not valid.

The following example illustrates the construction developed in the Theo-rem 2.14.

47

Example 2.16. Consider the following divisor cordial graph G .

0
1

1
0

Fig18

48

0
0

1
1

0
0

10

0 0

10

Fig 19

Here ef (0) = 11 ef (1) = 10.

Now we present divisor cordial labeling for the graphs obtained by joining apex vertices of
two stars to a new vertex. We extend this result for three copies of stars.

49

Definition
2.17. Consider two stars K1(1),n and K1(2),n .
G =< K(1) , K(2) > is the graph obtained by joining apex (central) vertices of
1,n

1,n

stars to a new vertex x .

Note that G has 2n + 3 vertices and 2n + 2 edges.

Definition 2.18. Consider t copies of stars namely K1(1),n, K (2)1,n, . . . , K (1t,n) . Then
G =< K1(1),n , K1(2),n , . . . , K1(t,n) > is the graph obtained by joining apex vertices of each
K1(m,n1) and K1(m,n) to a new vertex xm1 where 2 m t .
Note that G has t(n + 2) 1 vertices and t(n + 2) 2 edges. First we will prove
that < K1(1),n , K1(2),n > is divisor cordial.
Theorem 2.19. The graph G =< K1(1),n , K1(2),n > is divisor cordial.
Proof. Let v1(1) , v2(1) ,. . . , vn(1)

be the pendant vertices of

K1(1),n and

(2
v(2), v(2) ,.

. . , vn(2) be the pendant vertices of K

) . Let c1 and c2

be the apex

1,
1

vertices of K1(1),n and K1(2),n respectively and they are adjacent to a new common vertex x .
Now assign the label 1 to c1 and the largest prime number p such that p 2n+3 to c2 and
the remaining labels to the vertices of G . Since 1 divides
any integer the edges incident to

c1 contribute n + 1

to ef (1) and since p

does not divide any labels of the

vertices adjacent to

c2 , the edges incident

to c2 also contribute n + 1 to ef (0) . Hence |ef (0) ef (1)| = 0 . Thus G is divisor cordial.
Next we will extend this result to 3 stars as follows.
Theorem 2.20. The graph G =< K1(1),n , K1(2),n , K1(3),n > is divisor cordial.
Proof. Let Let v1(i), v2(i), . . . , vn(i) be the pendant vertices of K1(i,n) and let ci be the apex vertex
of K1(i,n) for i = 1, 2, 3 . Now c1 and c2 are adjacent to x1 and c2 and c3 are adjacent to x2 . Note
50

that G has 3n + 5 vertices and 3n + 4 edges.

Now assign the label 1 to c1 , 2 to c2 and p to c3 where p is the largest

prime number such that p 3n + 5 . Then assign the odd and even labels equally to the vertices
v1(2) , v2(2) ,. . . , vn(2), x1, x2 if n is even. Suppose n is odd,
then assign

n+1

odd labels and

n+3

even labels to these vertices. Then assign remaining labels

to the remaining vertices.

Since 1 divides any integer, the edges incident to c1 contribute n + 1 to ef (1) . Since p does
not divide any labels of the vertices adjacent to c3 , the
edges incident to c3

also contribute n + 1

labels and does not divide odd labels,

n+1

n+2 (

) to ef (0)

2 2

and

n+2

n+3

) to

to ef (0) . Since 2 divides even

the edges incident to c2 contribute

ef (1) if n is even (odd). Thus, if

2
n+2

n is even, then ef (0) = ef (1) = n + 1 +

ef (0) = n + 1 + n+1

3n+4

2 = 2

=2n+1 and ef (1) = n + 1 + n+3

and if n is odd then

= 2n + 2 and hence

|ef (0) ef (1)| 1 . Thus G is divisor cordial.

The Theorems 2.19 and 2.20 are explained using the following example.
Example 2.21. Consider the graph G =< K1(1),8 , K1(2),8 > .

51

A GRAPH LABELING IS AN ASSIGNMENT

In this section we give some definitions and other information which are useful for the
present work. The terms that are not defined here are used in the sense of Chartrand and
Lesniak [2].

Definition 1.1. A graph labeling is an assignment of integers to the vertices or edges or both
subject to certain condition(s). 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).

For an extensive survey on graph labeling and bibliographic references we refer to Gallian
[3]. Most of the graph labeling techniques trace their origin to graceful labeling introduced
by Rosa [6]
and Golomb [4]. The famous Ringel-Kotzig graceful tree conjecture and the illustrious work
by Kotzig [5] brought a tide of labeling problems having graceful theme.

In 1987, Cahit [1] introduced the concept of cordial labeling as a weaker version of graceful
and harmonious labelings. Some labeling schemes are also introduced with minor variations in
cordial theme. In 2004, Sundaram et al. [7] introduced the notion of product cordial labeling in
which the absolute di erence in cordial labeling is replaced by product of the vertex labels.

Vaidya and Barasara [8] introduced the edge analogue of product cordial labeling and
named it as edge product cordial labeling which is defined as follows.

Definition 1.2. For a graph G, the edge labeling function is defined as f : E(G) ! f0; 1g and the
induced vertex labeling function f : V(G) ! f0; 1g is given by f (v) = f (e1) f (e2) : : : f (en) if e1,
e2, : : :, en are the edges incident with the vertex
We denote the number of vertices of G having label i under f by v f (i) and the number of
edges of
G having label i under f by e f (i) for i = 0; 1.
f is called an edge product cordial labeling of a graph G if jv f (0) v f (1)j 1 and je f (0) e
(1)j 1. A graph G is called edge product cordial if it admits an edge product cordial labeling.
52

Vaidya and Barasara studied edge product cordial labeling for some new families of graphs
in [9] .
Definition 1.3. The graph Cn(t) is a one point union of t cycles Cn with a vertex in common.
In this paper we investigate some families of graphs that admit and that do not admit edge

Consequently, n( 4) is not an edge product cordial graph.

cordial labeling.

2 Main Results

Theorem 2.1. The graph Kn(n 4) is not an edge product cordial graph.
Proof: In order to satisfy the edge condition for edge product cordial graph it is essential to
assign
Theorem 2.2. The graph Km;n(m; n 2) is not an edge product cordial graph.
Proof: Without loss of generality we assume that n m.
Case 1: n is even.
In order to satisfy the edge condition for an edge product cordial graph it is essential to
assign label 0 to mn edges out of mn edges. The edges with label 0 will give rise at least m +
vertices with label
53

0 and at most 2ertices with label 1 out of the total m + n vertices. Therefore, jv f (0) v f (1)j m 2.
Thus the vertex condition for an edge product cordial graph is violated.

Case 2: m is even.

In order to satisfy the edge condition for an edge product cordial graph it is essential to
assign label 0 to

mn

edges out of mn edges. The edges with label 0 will give rise at least n +

vertices with label

54

SOME EDGE PRODUCT

CORDIAL GRAPHS
Remark 2.3. Vaidya and Barasara [8] proved that all tress are edge product cordial. Hence, the
graph

K1;n is edge product cordial

Theorem 2.4. The graph Cn(t) is an edge product cordial graph for t even or t and n are both odd
while is not an edge product cordial graph for t odd and n even.
Proof: Let ek;1; ek;2; : : : ; ek;n be the edges of kth copy of cycle Cn and v be a common vertex of
Cn(t). The edges ek;1 and ek;n of kth copy of cycle Cn are incident to v. We consider the following
three cases.

Case 1: t is even.

f (ei; j) = 0; 1 i

and 1 j n

t
f (ei; j) = 1; 2 + 1 i t

and 1 j n.

In view of the above defined labeling pattern we have,

=
v f (0) 1

v f (1)

t(n 1)
2

e f (0) = e f (1) = tn
2

55

Case 2: Both t and n are odd.

t 1
=
f (ei; j)

0;

1 i

and

1 j n

i t 1

and

1 j n

t+1
f (ei; j) =

1;

=
f (et; j)

n 1
0; 1 j

n+1
f (et; j) =

1;

i n.

In view of the above defined labeling pattern we have,

=v
v f (0) 1

f =

(1)

=
e f (0)

t(n 1)

= tn 1
e f (1) 1 2

Case 3: t is odd and n is even.

In order to satisfy the edge condition for an edge product cordial graph it is essential to
assign
t
n

t(n 1) + 3

label 0 to edges out of tn edges. The edges with label 0 will give rise at least
2

vertices
2

t(n 1) 1
with label 0 and at most 2

vertices with label 1 out of total t(n+

1)

1 vertices. Therefore

jv f (0) v f (1)j 2. Thus the vertex condition for edge product cordial graph is violated.
Therefore, the graph Cn(t) is an edge product cordial graph for t even or t and n are both odd
while it is not an edge product cordial graph for t odd and n even.
Illustration 2.5. The graph C5(3) and its edge product cordial labeling is shown in Figure 1.
56

3 Concluding Remarks

Cordial and edge product cordial labeling of a graph are two independent concepts and a
graph may possess one or both of these labelings or neither as exhibited below.

[1] Every tree is cordial as well as edge product cordial.

The friendship graph C3(t) for t 2(mod 4) is not cordial but it is edge product

0
Figure 22: An edge product cordial labeling of C5(3):

57

[2] cordial.

[3] The complete bipartite graph Km;n for m; n

2 is cordial but not edge product

cordial.

[4] The complete graph Kn for n 4 is neither cordial nor edge product cordial.
Acknowledgement

The authors are highly thankful to the anonymous referees for their kind comments and
fruitful suggestions on the first draft of this paper.

58

In the present work we investigate some classes of graphs and disjoint union of some
classes of graphs which admit prime labeling. We also investigate prime labeling of a graph
obtained by dentifying two vertices of two graphs. We also investigate prime labeling of a
graph obtained by identifying two edges of two graphs. Prime labeling of a prism graph is
also discussed. We show that a wheel graph of odd order is switching invariant. A necessary
and sufficient condition for the complement of W to be a prime graph is investigated. n

We begin with simple, finite, undirected and non-trivial graph G = ( V , E ) with the
vertex set V and the edge set E . The number of elements of V , denoted as V is called the
order of the graph G while the number of elements of E , denoted as E is called the size of
the graph G . In the present work C denotes the cycle n
with n vertices and P denotes the path of n vertices. In the wheel W = C + K the
vertex corresponding nn1to K is called the apex vertex and the vertices corresponding to C
are called the rim vertices. For various 1 ngraph theoretic notations and terminology we
follow Gross and Yellen [1] whereas for number theory we follow D. M. Burton [2]. We
will give brief summary of definitions and other information which are useful for the
present investigations.
Definition 1.1: If the vertices of the graph are assigned values subject to certain
conditions then it is known as graph labeling.
For latest survey on graph labeling we refer to J. A. Gallian [3]. Vast amount of
literature is available on different types of graph labeling and more than 1000 research
papers have been published so far in last four decades. For any graph labeling problem
following three features are really noteworthy:

59

We begin with simple, finite, undirected and non-trivial graph G = ( V , E ) with the vertex
set V and the edge set E . The number of elements of V , denoted as V is called the order of
the graph G while the number of elements of E , denoted as E is called the size of the
graph G . In the present work C denotes the cycle n
with n vertices and P denotes the path of n vertices. In the wheel W = C + K the
vertex corresponding nnn1to K is called the apex vertex and the vertices corresponding to
C are called the rim vertices. For various 1 ngraph theoretic notations and terminology we
follow Gross and Yellen [1] whereas for number theory we follow D. M. Burton [2]. We
will give brief summary of definitions and other information which are useful for the
present investigations.
Definition 1.2: A prime labeling of a graph G of order n is an injective function f :
V

n
such that for every pair of adjacent vertices u and v , gcd ( f ( u), f ( v)) = 1. The

graph which admits prime labeling is called a prime graph.

The notion of prime labeling was originated by Entringer and was discussed in
A.Tout [4]. Many researchers have studied prime graphs. It has been proved by H. L. Fu
and C. K. Huang [5] that P is a prime graph. It has n
been proved by S. M. Lee [6] that wheel graph W is a prime graph if and only if n
is even. T. Deretsky [7] nhas proved that cycle C is a prime graph. n
Definition 1.3: A vertex switching G of a graph G is the graph obtained by taking a
vertex v of G , v
removing all the edges incident to v and adding edges joining to every other vertex
which is not adjacent to v in G .
60

Definition 1.4: A prime graph is said to be switching invariant if for every vertex v
of G , the graph G obtained by switching the vertex v in G is also a prime graph.
Definition 1.5: For two graphs G = V , E and G = V , Etheir cartesian product G G is
defined 2( 2 2 )1( 1 1)12
Definition 1.6: C P is called prism graph. n2
Bertrands Postulate 1.7: For every positive integer n > 1 there is a prime p such
that n < p < 2 n .
2. Some Results on Prime Labeling
Theorem 2.1: If G is a prime graph with order n , where n is even and G is a
graph with order 3 then 12disjoint union of G and G is a prime graph. 12
Proof: Let u , u , u

u be the vertices of G and v , v , v be the vertices of G . Let

G be a disjoint 1
Thus G admits a prime labeling. So G is a prime graph.
Theorem 2.2: If G is a prime graph with order n , where n is divisible by 6 and G
is a prime graph 12
with order 5 then disjoint union of G and G is a prime graph. 12
Proof: Let u , u , u

u be the vertices of G and v , v , v , v , v be the vertices of G

. Let G be the 1
Definition 1.2: A prime labeling of a graph G of order n is an injective function f : V
n

61

such that for every pair of adjacent vertices u and v , gcd ( f ( u), f ( v)) = 1. The
graph which admits prime labeling is called a prime graph.
The notion of prime labeling was originated by Entringer and was discussed in
A.Tout [4]. Many researchers have studied prime graphs. It has been proved by H. L. Fu
and C. K. Huang [5] that P is a prime graph. It has n
been proved by S. M. Lee [6] that wheel graph W is a prime graph if and only if n
is even. T. Deretsky [7] nhas proved that cycle C is a prime graph. n
Definition 1.3: A vertex switching G of a graph G is the graph obtained by taking a
vertex v of G , v
removing all the edges incident to v and adding edges joining to every other vertex
which is not adjacent to v in G .
Definition 1.4: A prime graph is said to be switching invariant if for every vertex v
of G , the graph G vobtained by switching the vertex v in G is also a prime graph.
Definition 1.5: For two graphs G = V , E and G = V , E
Case 1: If e = v v
then gcd ( f ( v ), f ( v
= gcd i, i +1 = 1 , for i

p 2 . i i 1+ ))() i i 1

Case 2: If e = v v
then gcd ( f ( v , f = gcd 1, p 1 = 1 . 1 )( p 1)1 p 1

Case 3: If e = v v then gcd ( f ( v , f v

62

= gcd p, i = 1, for i

p 1. 0 ( i ))( )0 i

Case 4: If e = u u
then gcd ( f ( u ), f ( u
= gcd p + i, p + i +1 = 1, for i

p 2 . i 1+ ))( i 1+65

Thus G admits a prime labeling. So G is a prime graph.

Theorem 2.9: If n 3 is an odd integer then the prism graph C P is not prime. n2
Proof: In the prism graph C P there are two cycles C . So total number of vertices
are 2 n . So we have n2 n
to use 1 to 2 n natural numbers to label these vertices, and from 1 to 2 n there are n
even integers. If n is n 1
odd then we can use at the most
even integers to label the vertices of a cycle C . We have such two n n 1 n 1
cycles, so we can use at the most= n 1 even integers to label the vertices of C P .
But from 1 22 n2to 2 n there are n even integers. So such prime labeling is not possible.
Thus C P is not prime if n 3 is an odd integer. n2

63

Theorem 2.10: If p 3 is a prime number then the prism graph C P is prime. p 12

Proof: In the prism graph C P , let v , v , v
v p 21,11,21,31, p 12,12,2 v

vbe the vertices of one cycle and v ,

vbe the vertices of the other cycle and a vertex v is

joined with v by an edge for 2,3

2, p 11, i2, i i
jfor i = 1, j

p 1 . Define a function f : V ( G
p

f(v

p + jfor i = 2, j

p 2 as
p 2; i, j

pfor

i = 2, j = p 1.
f is an injective function. Let e be an arbitrary edge of G . To prove f is a
prime labeling of G we have the following cases:
Case 1: If e = v v
then gcd ( f ( v, f v
= gcd j, j +1 = 1 , for j

p 2 . 1, j )( 1, j 1+)

1, j 1, j 1
+Case 2: If e = v vthen gcd ( f ( v, f v
= gcd p + j, p + j +1 = 1, for j

p 3. 2, j )( 2, j 1+)

2, j 2, j
Case 3: If e = v v
then gcd ( f ( v , f v
= gcd 1, p 1 = 1. 1,1 )( 1, p 1)
1,1 1, p 1

64

Case 4: If e = v vthen gcd ( f ( v f v

= gcd 2 p 2, p = 1 .
2, p 2 )( 2, p 1)2, p 2 2, p 1
Case 5: If e = v v
then gcd ( f ( v, f v= gcd p +1, p = 1. 2,1 )( 2, p 1)()2,1 2, p 1
Case 6: If e = v v
then gcd ( f ( vf v
= gcd j, p + j = gcd j, p = 1, for j = 1,2,

p 2 . 1, j )

( 2, j )1, j 2, j
Case 7: If e = vv
then gcd ( f ( , f v
= gcd p 1, p = 1. 1, p 1 )
( 2, p 1)1, p 12, p 1
Thus G admits a prime labeling. So G is a prime graph.
All graphs in this paper are finite, simple and undirected. Terms not defined here are used in
the sense of Harary [9]. The symbols V (G) and E(G) denote the vertex set and edge set of a
graph. Labeled graphs serve as useful models for a broad range of applications [14].
Many studies in graph labeling refer to Rosas research in 1967 [11]. A graph labeling is
an assignment of integers to the vertices or edges or both subject to certain conditions. 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). Graph labeling was first introduced in the late 1960s.
65

The concept of mean labeling was introduced in [12] and that of odd mean labeling in
[10]. k-odd mean labeling and (k, d)-odd mean labeling are introduced and discussed in [5
7]. k-even mean labeling was introduced in [8]. In this paper, we introduce the concept of
(k, d)-even mean labeling and investigate the (k, d)-even mean labeling of Pm nK1.
Throughout this paper, k and d denote any positive integer 1. For brevity, we use (k,
d)-EML for (k, d)-even mean labeling.

In this paper we introduce a new graph labeling known as k-Product cordial labeling of
graphs.Let f be a map from V(G)to{0,1,...k-1}where k is an integer,1k

V(G) .For each edgeuv assign the label f(u) f(v)( mod k). f is called a k- Product cordial
labeling if vf (i) - vf (j) 1, and ef (i) - ef (j) 1, i,j{0,1,..k-1},where vf(x)

and ef(x) denote the number of vertices and edges respectively labeled with x
(x=0,1,2,3..k-1).We investigatethe k-Product cordial labeling behavior of stars, bistars
and also the 4-Product cordial labeling behavior of paths,complete graphs, and combs.

The graphs considered here are finite, undirected and simple. The vertex set and edge set of
a graph G are denoted by V(G) and E(G) respectively.Product cordial labeling and
Extended Product cordial labeling (EP cordial labeling) of graphs were introduced by
M.Sundram,R.Ponraj and S.Somasundram in[2]and [3] respectively. In this paper we
introduce the k-Product cordial labeling of graphs and investigate the k- Product cordial
labeling behaviour of stars,bistars and also the 4- Product cordial labeling behavior of paths,
cycles,combs etc.Terms not defined here are used in the sense of Harary[1].

66

Definition 2.1:
Let f be a map from V(G) to {0,1.k-1} where k is an integer,1k V(G) . For each edge
uv, assign the label f(u)f(v) (mod k). f is called k- Product cordial labeling of G if vf (i) - vf
(j) 1, and ef (i) - ef (j) 1 ,
i,j {0,1,..k-1}where vf (x) and ef (x) respectively denote the number of vertices and edges
respectively labelled with x(x=0,1,2k-1).A graph with a k- Product cordial
labeling is called k- Product cordial graph.
Remark: Any 2- Product cordial labeling is simply Product cordial labeling and

3-

Product cordial labeling is EP- cordial labeling.

Theorem 2.2: Every graph is a subgraph of a connected k-Product cordial graph.
Proof: Let G be a (p,q) graph. Consider the complete graph Kp. Let V(Kp)

{u1,u2...,up}.Take
( k-1)

copies of the star

be the central vertex of the ith copy

.Let v

1,pc

2
.Identify the vertex ui with vi (1 i k 1). Let the resulting graph be G1.We

of K1,pc
2

now construct the graph G* as follows. Let m = pc2-p and V (K

c
m )

= {w1,w2 ....,wm}. Let

m=(k-1)t+r , 0 r k 1. The graph G* is obtained from G1 and Kmc by joining

the vertices wi (1 i t) to any one of the pendant vertices of the first copy of K1,pc2 . Next
join wt+i (1 i t) to any one of the pendant vertices of the second copy of K1,pc2 .Proceed
like this after the (k-2)th step joining w(k-2)t+i (1 i t) to one of the pendant vertices of the
last copy of K1,pc2 .Next join the vertex w(k-1)t+i (1 i r ) to any one of the pendant
vertices of ith copy K1,

pc2

. Finally join u1 to wi (1it).Clearly the new graph G* is a

connected super graph of G. Assign the label 1to all the vertices of
Kp and assign 0 to all the vertices of first copy of

K1,pc and assign the label i to all

2

the vertices of ith copy of K1,pc2 (2 i<k-1).Also assign 1 to all the vertices of Kmc.
Obviously this vertex labeling is a k-Product cordial labeling of G*, since vf(i) =pc2 and
ef(i)=pc2+t (0 i<k-1).
Corollory 2.3:Every graph is a subgraph of a connected Product cordial and a connected
67

EP- cordial graph.

Theorem 2.4: Any star is k- product cordial.

Proof: Let V (K1,n) = {u , u i : 1 i n }and E (K1,n) = {uu i :1 i n} Case(i) : n
0(mod k) .Let n= tk.
Define f (u) =k-1
f (ui) = i-1 , 1 i k
f (uk+i) = i-1 , 1 i k
f (u(t-1)k+i) =i-1 ,1 i k
Here vf(i)=t (0ik-2) and vf(k-1)=t+1.ef(i)=t (0ik-1).
Case(ii) : n r (mod k) 0 < r k 1.
Let n = tk + r , 0 < r k 1.Assign labels to u,ui (1 i tk ) as in case(i).Assign f
(utk+i)= i-1,1i r .
Here vf(i)=t+1 (0ik-1) .ef(0)=t+1 ef(i)=t , 1ik-1. Therefore f is a k-Product cordial
labeling.
Illustration 2.5: A 5-Product cordial labeling of

68

K1, 12 is

2
4

1
0

Figure(i) 23

Theorem2.6: Any Bistar is k- Product cordial.

Proof: Let V(B m,n )={u,v,ui,vj :1 i n,1 j m}and E(B m,n )={uui,vvj,uv : 1 i n,1 j
Case(i) : m 0(mod k) and n 0(mod k).Let m = t1 k, n = t 2 k.
Assign f (u) =k-1 and f(v) =k-1.
f (ui) = i-1 , 1 i k
f (u k +i ) = i-1 , 1 i k
.f (u ( t 1 1 ) k + i ) = i-1 , 1 i k f (vi) = i-1 , 1 i k
f (v k +i ) = i-1 , 1 i k
f (v ( t 2 1 ) k + i ) = i-1 , 1 i k 1 .
f (v

n )=0.

Here vf(0)=vf(k-1)=t1+t2+1, vf(i)=t1+t2(1ik-2), ef(0)= t1+t2+1,ef(i)=t1+t2(1ik-1).

Hence f is a K-Product cordial labeling.
Case(ii) : m r(mod k) ,n

l (mod k)

Let m = t1 k + r, 0 < r k 1:n = t 2 k + l , 0 < l k 1.

(1it1k) and

69

Assign

labels to u,v,ui

i (1it2k) as in case (i). Define

f (u t 1 k + i ) = i , 1 i r
f (v t 2 k + i ) = r + i , 1 i k 1 r
f (v

t2k+k1r+i

) = i -1

, 1 i l k +1 + r.Clearly f is a

labeling.
Illustration2.7:A 6-Product cordial labeling of B8,8. Figure24

70

k- Product cordial

3. 4- Product cordial labeling

Here we investigate the 4- Product cordial labeling behaviour of some standard graphs.
Theorem3.1: The Path Pn is 4-Product cordial iff n 11
Proof:Let Pn.: u1 u2 u3..un. be the path.
Case (i ) : n 11
The following table gives the 4- Product cordial labeling of Pn, n 11.
Vertex labeles :

u1

u2

u3

u4

u5

u6

u7

u8

u9

u10

10

11

u11

Case (ii) : n 12.If possible let there be a 4-Product cordial labeling f.

Case(ii)a: n 0(mod 4).

Let n= 4t .Thus ef(i)=t or t-1 (i=0,1,2,3). Obviously vf(0)=t and 0 must be assigned
consecutively.(otherwise ef(0) >t+1 an impossibility) .Thus ef(0)=t or t+1 But ef(0) cant
be t+1. Therefore e f(0)= t and hence ef(3)=t or t-1.Assume ef(3)=t .To get the edge label
3,1 and 3 must be the labels of adjacent vertices.When t is odd, the number

of vertices labeled with 1 are t +1 and the number of vertices labeled with 3 are t +1
71

2
.Therefore the
t +1
t

remaining

vertices to be labeled with 1 are

= .Similarly
2

number of

the number of remaining vertices to be labeled with 3 are

2 2

1
,

2
t

Therefore ef(1) ( 1) +(
2

1) t 3, a contradiction. When t is even , to get

2
t

a edge label 3, we should have either

t +2
or

. vertices labeled with 1. Without loss.

2

t
of generality assume that it is

t
.Thus the number of vertices labeled with 3 are

2
t

+1.Therefore the remaining number of vertices labeled with 1 aret

t
= and the

remaining number of vertices labeled with 3 aret (2t +1) = 2t 1

Therefore ef(1) (2t 1) +(2t 11) (t 3) a contradiction. Therefore ef(3) cannot be
t. A similar argument shall show that it can neither be t-1. Thus in case n 0 (mod 4) ,
there cannot be a 4-Product cordial labeling for G. The othere cases namely n 1 (mod
4), n 2 (mod 4) and n 3 (mod 4) can be
dealt with on similar lines.

72

Theorem 3.2: Cn is 4-Product cordial graph iff n=5 or 6 or 7 or 9 or 10.

Proof:Let u1.u2.u3..unu1. be the cycles of Cn.
Case(i) n= 5 or 6 or 7 or 9 or 10.
4-Product cordial labeling of C 5,C6,C7,C9,C10 are given below.

u1

u2

u3

u4

u5

u6

u7

u8

u9

10

u10

Case(ii) : n 0 (mod 4).

If possible, let there be a 4- Product cordial labeling f.

Let n= 4t .Then vf(0)= vf(1) = vf(2) = vf(3) = t . Clearly ef(0) t +1 , an impossibility.

Case (iii) : n 1 (mod 4).

Let n=4t+1(t>2).Thus ef(i)=t or t+1 (i=0,1,2,3). Obviously vf(0)=t and 0 must be assigned
consecutively.(otherwise ef (0) >t+2 an impossibility).Thus ef(0)= t+1 . Hence ef(3)=t.To
get the edge label 3,1 and 3 must be the labels of adjacent vertices.When t is

odd, the number of vertices labeled with 1 are

with 3 are t +21 .

73

t + 1
2

and the number of vertices labeled

Subcase(i):vf(1)=t and vf(3)=t Therefore the number of remaining vertices to be

t +1
labeled with 1 are t

t
=

2
t

labeled with 3

1
.Similarly the number of remaining vertices to be
2

.Therefore ef(1)

are
2

( 1) +(

1
1) t 3,

contradiction.When t is even , to get an edge label 3,the number of vertices labeled with 1
should be either 2t or t +22 .Without loss of generality assume that it is 2t .Thus
the number of vertices labeled with 3 are 2t +1. Therefore the remaining number of
t
vertices labeled with 1 aret

=
2

t
3 aret (

and the remaining number of vertices labeled with

2

t
+1) = 1.

Subcase(ii): vf(1)=t+1 and vf(3)=t. In this case,when t is odd,

2
t 1

t +1
ef(1) (

1) + (
2

1) t 2, a
2
t

contradiction.When t is even, ef(1) ( +11) +(

2
t

11) t 2, a contradiction. or
2

ef(1) (2 1) +(2 1) t 2, a contradiction.

74

Subcase(iii): vf(1)=t and vf(3)=t+1.

Similar to subcase(ii) here also we get contradictions.
Thus in case n 1 (mod 4) , there cannot be a 4-Product cordial labeling for G. The othere
cases namely n 2 (mod4) (n>10) and n 3 (mod 4) (n>7) can be dealt with
on similar lines.
Remark:C3 is not 4-Product cordial graph.
Theorem3.3: The complete graph Kn is 4-Product cordial iff n 2 .
Proof:Clearly K1,K2 are 4-Product cordial. By enumerating the values of ef(0), we can
easily prove that Kn (3n7) is not 4-Product cordial.
Case(i) : n 0 (mod 4) , n>4.
Let n= 4t ,t>1.Then vf(0)= vf(1) = vf (2) = vf(3) = t .Clearly ef(2) = t2+t2 = 2t2 and ef(3) =
t2. Therefore ef(2)-ef(3)=t2 >1, a contradiction.
Case (ii) : n 1 (mod 4) ,n>5. Let
n=4t+1 ,t>1.
Subcase (i) : vf(0) = t+1.In this case,as above ef(2)-ef(3)=t2 >1,an impossibility.
Subcase (ii) : vf(0) = t.
Here the following cases arise :
a.vf(1) =t, vf(2) =t, vf(3) = t+1 b.
vf(1) =t+1, vf(2) =t, vf(3) = t

75

c. vf(1) =t, vf(2) =t+1, vf(3) = t.

In case (a), ef(2)-ef(3)=2t2+t- t(t+1) = t2 >1, a contradiction.Incase (b), ef(2)-ef(3)=
t(t+1)+t2-(t+1)t = t2 >1,a contradiction. In case (c), ef(2)-ef(3)= t(t+1)+t(t+1)-(t+1)t =
t2+t >1,a contradiction.
Case (iii) : n 2 (mod 4) .
Let n=4t+2 , t 2
Subcase (i) : vf(0) = t+1.
Here the following cases arise:
a.vf(1) =t, vf(2) =t, vf(3) = t+1
b.vf(1) =t+1, vf(2) =t, vf(3) = t
c. .vf(1) =t, vf(2) =t+1t, vf(3) =
t.
Incase (a) ,ef(2)-ef(3)= t2+t2+t-(t2+t) = t2 >1, a contradiction. Incase (b), ef(2)-ef(3)=
t2+t2+t-(t2+t) = t+1 >1,a contradiction. Incase (c) ,ef(2)-ef(3)= t2+t+t2+t-t2 = 2t2+t
>1,an impossiplity.
Subcase (ii) : vf(0) = t
Here also the following three cases arise:
a) vf(1) =t, vf(2) =t+1, vf(3) = t+1
b) vf(1) =t+1, vf(2) =t, vf(3) = t+1
c) vf(1) =t+1, vf(2) =t+1, vf(3) = t.
In the case (a) ef(2)-ef(3)= t(t+1)+(t+1)(t+1)-(t+1)t = t2+2t+1 >1, a contradiction. In
the case (b) ef(2)-ef(3)= t(t+1)+t(t+1)- (t+1)(t+1) = t2-1>1, a contradiction .In case (c)
ef(2)-ef(3)= (t+1)(t+1)+ t(t+1)-(t+1)t = t2+2t+1 >1,a contradiction.
Case (iv) : n 3 (mod 4) .Let n=4t+3, t 1

Subcase (i) : vf(0) = t+1.

the following cases are
arises:
a.vf(1) =t, vf(2) =t+1, vf(3) = t+1
b.vf(1) =t+1, vf(2) =t, vf(3) = t+1
c.vf(1) =t+1, vf(2) =t+1, vf(3) = t.
76

All the cases a,b,c, ef(2)-ef(3) >1,a contradiction.

Subcase (ii) : vf(0) = t.
Then vf(1) = vf(2) = vf(3) = t+1, ef(2)-ef(3)=(t+1)2 >1, a contradiction.
Therefore Kn , n>2 is not a 4-Product cordial graph.
Definition 3.4: The corona G1 G2 of two graph G1 and G2 is defined as the graph G.
Obtained by taking one copy of G1 ( which has p1 vertices) and p1 copies of p2 and
then joining the ith vertex of G1 to every vertices in the ith copy G2.
Theorem 3.5:The comb Pn K1 is 4- Product cordial.
Proof:Let Pn be the path u1,u2,u3..un.Let vi be the pendant vertex adjacent to ui ( 1

in)
Case (i ) : n 0(mod 4) .
Define f (u 4 i+1 )=1, 0 i n 4
4
f (u 4 i+2 )=1,

0 i n 4
4

77

Main Results
Definition 2.1. A (p, q) graph G is said to have a (k, d)-even mean labeling if there exists
an injection
f : V {0, 1, 2, . . . , 2k + 2(q 1)d}
such that the induced map f defined on E by

f (u)+f (v)
2

f(uv) =

f (u)+f (v)+1

if f(u) + f(v) is even

,

if f(u) + f(v) is odd

is a bijection from E to {2k, 2k + 2d, 2k + 4d, . . . , 2k + 2(q 1)d}.

A graph that admits a (k, d)-even mean labeling is called a (k, d)-even mean graph.

Theorem 2.2. Pm nK1 (m 3, n 2) is a (k, d)-even mean graph if

[1] m is even and for any k and d

[2] m is odd, n is odd and for any k and d

[3] m is odd, n is even and for any k d.

Proof. Let V (Pm nK1) = {ui, 1 i m} {uij , 1 i m, 1 j n} and E(Pm nK1} =

{ei, 1 i m 1} {eij , 1 i m, 1 j n} (see Fig.1)

78

Figure 1: Ordinary labeling of Pm nK1

In this graph q = m(n + 1) 1.

Define f : V (Pm nK1) {0, 1, 2, . . . , 2k + 2(q 1)d}

Case (i) m is even and for any n, k and d.

For 1 i m 1,
f(ui) =

fu

2k + 2d(i 1)(n + 1) 1,

if i is odd

2k + 2d[2n + (n + 1)(i 2)] + 1,

if i is even.

2k + 2d[m(n + 1)

2].

( m) =

For 1 i m and 1 j n,
f(uij ) =

2k + 2d[(i 1)(n + 1) + 2j 2] + 1, if i is odd

2k + 2d[(i 2)(n + 1) + 2j] 1,

if i is even.

induced edge labels are as follows:

Then the
For 1 i m 1,

f(ei) =
For 1

2k + 2d[n + (n + 1)(i 1)],

if i is odd

2k + 2d[2n + 1 + (n + 1)(i 2)],

if i is even.

i m and 1 j n; f(eij ) = 2k + 2d[(n + 1)(i 1) + j 1].

Therefore, f(E(Pm nK1)) = {2k, 2k + 2d, 2k + 4d, . . . , 2k + 2(q 1)d}. So, f is a (k, d)even mean labeling and hence, Pm nK1 is a (k, d)-even mean graph.

The examples for (2, 1)-EML of P4 10K1 and (2, 3)-EML of P4 5K1 are shown in Figure
26 and Figure 27 respectively.

79

Figure 2: The examples for (2,1)-EML of P4

Figure 28: The examples for (2,3)-EML of P4

10K1

5K1

Case (ii) m is odd, n is odd and for any k, d.

The vertex labels are as follows:

For 1 i m 1,
f(ui) =

fu
(

2k + 2d(i 1)(n + 1) 1,

if i is odd

2k + 2d[2n + (n + 1)(i 2)] + 1,

if i is even.

2k
m)

1 + 2d[m(n + 1)

2].

For 1 i m 1 and 1 j n,
f(uij ) =

2k + 2d[(i 1)(n + 1) + 2j 2] + 1,

if i is odd

2k + 2d[(i

if i is even.

2)(n + 1)

+ 2j]

f(u

) = 2k + 2d[n + (n + 1)(m
mj

1,

3) + 2j

1],

n1
2

n+1
f(umj ) = 2k + 2d[n + (n + 1)(m

3) + 2j + 1],

80

j n.

Then the induced edge labels are as follows:

For 1 i m 2,

f (ei) =

e
(

2k + 2d[n + (n + 1)(i 1)],

if i is odd

2k + 2d[2n + 1 + (n + 1)(i 2)],

if i is even.

= 2k + d[2m(n + 1)

m1)

5].

For 1 i m 1 and 1 j n,
f(eij ) = 2k + 2d[(n + 1)(i 1) + j 1].
2k + 2d[n(m

f (emj ) =

3], 1 j

1) + m + j

n 1
2

n+1

2k + 2 d[n(m 1) + m + j 2],

2 j n.

Therefore, f(E(Pm nK1)) = {2k, 2k + 2d, 2k + 4d, . . . , 2k + 2(q 1)d}. So, f is a (k, d)even mean labeling and hence, Pm nK1 is a (k, d)-even mean graph.

The examples for (1, 2)-EML of P3 7K1 and (2, 3)-EML of P3 9K1 are shown in
Figures 4 and 5 respectively.

81

(k, d)-even mean labeling of Pm nK1

Figure 29: (2,3)-EML of P3

21
9K1

Case (iii) m is odd, n is even and for any n, k d.

The vertex labels are as follows:

For 1 i m 1,
f(ui) = 2k + 2d[(i 1)(n + 1) 1] + 1,

if i is odd

2k 1 + 2d[2n + 1 + (n + 1)(i 2)],

f(u

) = 2k + 2d[m(n + 1)
m

if i is even.

2].

For 1 i m 1 and 1 j n,

f(uij ) =

2k 1 + 2d[(n + 1)(i 1) + 2j 1],

2k + 2d[(n + 1)(i 2) + 2j 1] + 1,

if i is even.

2k + 2d[(n + 1)(m 2) + 2(j 1)],

1j 2

f(umj ) =

n+2

2k + 2d[(n + 1)(m 2) + 2j],

f(u

) = 2k
mn

if i is odd

1 + 2d[m(n + 1)

2 j n 1.

2].

Then the induced edge labels are as follows:

For 1 i m 2,
2k + 2d[n + (n + 1)(i 1)],
2k + 2d[2n + 1 + (n + 1)(i 2)],
f(em1) = 2k + d[2m(n + 1) n 4]. For 1 i

82

m 1 and 1 j n,
f(eij ) = 2k + 2d[(n + 1)(i 1) + j 1].

2k + 2d[n(m 1) + m + j 3],
2k + 2d[m(n + 1) n + j 2],
f(emn) = 2k + 2d[m(n + 1) 2].

Therefore, f(E(Pm nK1)) = {2k, 2k + 2d, 2k + 4d, . . . , 2k + 2(q 1)d}. So, f is a (k, d)even mean labeling and hence, Pm nK1 is a (k, d)-even mean

graph.

The example for (4,2)-EML of P5

4K1 is shown in Fig. 30

83

REFERENCES

1. J. Gross and J. Yellen, Graph Theory and its applications, CRC Press, (1999).
2.

D. M. Burton, Elementary Number Theory, Brown Publishers,

Second Edition, (1990).

3.

L. W. Beineke and S. M. Hegde, Strongly Multiplicative graphs,

Discuss. Math. Graph Theory, 21 (2001) 63-75.

4. V. Yegnanaryanan and P. Vaidhyanathan, Some Interesting Applications

of Graph Labellings, J. Math. Comput. Sci., 2 (5) (2012) 1522-1531.
5. J. A. Gallian, A dynamic survey of graph labeling, The Electronic
Journal of Combinatorics, 19, (2012), # DS6.
Available: http://www.combinatorics.org
6. I. Cahit, Cordial Graphs, A weaker version of graceful and harmonious
Graphs, Ars Combinatoria, 23 (1987) 201-207.
7. M. Sundaram, R. Ponraj and S. Somasundram, Prime Cordial Labeling of
graphs, J. Indian Acad. Math., 27 (2) (2005) 373-390.
8.

S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some

graphs, Modern Applied Science, 4 (8) (2010) 119-126.
Available: http://ccsenet.org/journal

9. S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some cycle

related graphs, Int. J. of Open Problems in Computer Science and
Mathematics, 3 (5) (2010) 223-232.
Available: http://www.ijopcm.org
10. S. K. Vaidya and N. H. Shah, Some New Families of Prime Cordial
Graphs, J. of Mathematics Research, 3 (4) (2011) 21-30.
Available: http://www.ccsenet.org
11. S. K. Vaidya and N. H. Shah, Prime Cordial Labeling of Some Graphs,
Open

Journal

of

Discrete

Mathematics,

doi:10.4236/ojdm.2012.21003
84

(2012)

11-16.

Available: http://www.scirp.org
12. S. K. Vaidya and N. H. Shah, Prime cordial labeling of some wheel
related graphs, Malaya Journal of Matematik, 4 (1) (2013) 148 - 156.
Available: www.malayajournal.org/
13. R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, Divisor
Cordial Graphs, International J. Math. Combin., 4 (2011) 15-25.
14. R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, Special
Classes of Divisor Cordial Graphs, International Mathematical Forum,
7 (35) (2012) 1737-1749.
15. Cahit, Cordial graphs: A weaker version of graceful and harmonious Graphs, Ars
Combinatoria, 23, (1987), 201-207.

16. Chartrand and L. Lesniak, Graphs and Digraphs, Chapman & Hall, New York, 2004.

17. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of

Combinatorics, 19, #DS6, 2012.

18. W. Golomb, How to number a graph, in Graph Theory and Computing (edited by R. C.
Read), Academic Press, New York, (1972), 23-37.

19.. Kotzig, On Certain Vertex Valuations of Finite Graphs, Util. Math., 4, (1973), 67-73.

20..G.S. Bloom, S.W. Golomb, Applications of numbered undirected graphs, Proc. IEEE, 65
(1977), 562570.

21.G.S. Bloom, S.W. Golomb, Numbered complete graphs, unusual rulers and assorted
applications, Theory and Applications of Graphs - Lecture notes in Math., Springer-Verlag,
New York, 642 (1978), 53-65.

22.G.S. Bloom, D.F. Hsu, On graceful digraphs and a problem in network ad-dressing,
Congressus Numerantium, 35 (1982), 91-103.
85

23.A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combi-natorics, 17

(2010) # DS6.

24.B. Gayathri, K. Amuthavalli, k-odd mean labeling of crown graphs, Interna-tional Journal
of Mathematics and Computer Science, 3(2) (2007), 253-259.

25..B. Gayathri, K. Amuthavalli, (k, d)-odd mean labeling of some graphs, Bul-letin of Pure
and Applied Sciences, 26E(2) (2007), 263-267.

26.B. Gayathri, K. Amuthavalli, k-odd mean labeling of hK1,n : K1,mi, Acta Ciencia Indica,
XXXIVM(2) (2008), 827-834.

27.B. Gayathri, R. Gopi, k-even mean labeling of Dm,n@Cn, International Jour-nal of

Engineering Science, Advanced Computing and Bio-Technology 1(3) (2010), 137-145.

28.F. Harary, Graph theory, Addison-Wesley, Reading, Massachusetts, 1972.

86

87