Documente Academic
Documente Profesional
Documente Cultură
3(2017), 125-135
R.Ponraj
(Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627412, India)
Key Words: Cordial labeling, Smarandachely cordial labeling, cycle, star, bistar, splitting
graph.
AMS(2010): 05C78.
§1. Introduction
In this paper graphs are finite, simple and undirected. Let G be a (p, q) graph where p is the
number of vertices of G and q is the number of edge of G. In 1987, Cahit introduced the concept
of cordial labeling of graphs [1]. Sundaram, Ponraj, Somasundaram [5] have been introduced
the notion of prime cordial labeling and discussed the prime cordial labeling behavior of various
graphs. Recently Ponraj et al. [7], introduced k-prime cordial labeling of graphs. A 2-prime
cordial labeling is a product cordial labeling [6]. In [8, 9] Ponraj et al. studied the 4-prime
cordial labeling behavior of complete graph, book, flower, mCn , wheel, gear, double cone, helm,
closed helm, butterfly graph, and friendship graph and some more graphs. Ponraj and Rajpal
singh have studied about the 4-prime cordiality of union of two bipartite graphs, union of trees,
durer graph, tietze graph, planar grid Pm × Pn , subdivision of wheels and subdivision of helms,
lotus inside a circle, sunflower graph and they have obtained some 4-prime cordial graphs from
4-prime cordial graphs [10, 11, 12]. Let x be any real number. In this paper we have studied
about the 4-prime cordiality of shadow graph of a path, cycle, star, degree splitting graph of a
bistar, jelly fish, splitting graph of a path and star. Let x be any real number. Then ⌊x⌋ stands
for the largest integer less than or equal to x and ⌈x⌉ stands for smallest integer greater than
or equal to x. Terms not defined here follow from Harary [3] and Gallian [2].
Let G be a (p, q) graph. Let f : V (G) → {1, 2, · · · , k} be a map. For each edge uv, assign
the label gcd (f (u), f (v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈
{1, 2, · · · , k} and |ef (0) − ef (1)| ≤ 1, and conversely, if |vf (i) − vf (j)| ≥ 1, i, j ∈ {1, 2, · · · , k}
or |ef (0) − ef (1)| ≥ 1, it is called a Smarandachely cordial labeling, where vf (x) denotes the
number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges
labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a
k-prime cordial graph.
First we investigate the 4-prime cordiality of shadow graph of a path, cycle and star. A
shadow graph D2 (G) of a connected graph G is constructed by taking two copies of G, G′ and
G′′ and joining each vertex u′ in G′ to the neighbors of the corresponding vertex u′′ in G′′ .
Proof It is easy to see that D2 (P2 ) is not 4-prime cordial. Consider n > 2. Let
V (D2 (Pn )) = {ui , vi : 1 ≤ i ≤ n} and E(D2 (Pn )) = {ui ui+1 , vi vi+1 : 1 ≤ i ≤ n − 1} ∪
{ui vi+1 , vi ui+1 : 1 ≤ i ≤ n − 1}. In a shadow graph of a path, D2 (Pn ), there are 2n vertices
and 4n − 4 edges.
Table 1
f (u n2 +1 ) = f (u n2 +2 ) = f (u n2 +3 ) = f (v n2 +2 ) = 3 and f (v1 ) = f (v n2 +3 ) = 1.
n+3
f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n+3
f (u2i ) = 4, 1 ≤ i ≤ 4
n−1
f (v2i ) = 2, 1 ≤ i ≤ 4
n−1
f (v2i+1 ) = 4, 1 ≤ i ≤ 4
n−5
f (v n+5 +2i ) = f (u n+5 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n−9
f (v n+7 +2i ) = f (u n+7 +2i ) = 3, 1 ≤ i ≤ 4
2 2
128 R.Ponraj, Rajpal Singh and R.Kala
Obviously D2 (C6 ) does not permit a 4-prime cordial labeling. For n 6= 6, we define a
function f from V (D2 (Cn )) to the set {1, 2, 3, 4} by
n+2
f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n+2
f (u2i ) = 4, 1 ≤ i ≤ 4
n−2
f (v2i ) = 2, 1 ≤ i ≤ 4
n−2
f (v2i+1 ) = 4, 1 ≤ i ≤ 4
n−6
f (v n+6 +2i ) = f (u n+6 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n−8
f (v n+8 +2i ) = f (u n+8 +2i ) = 3, 1 ≤ i ≤ 4
2 2
and
Clearly D2 (C3 ) is not a 4-prime cordial graph. Let n 6= 3. Define a map f : V (D2 (Cn )) →
{1, 2, 3, 4} by f (v1 ) = 1,
n+1
f (v2i ) = f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n+1
f (v2i+1 ) = f (u2i ) = 4, 1 ≤ i ≤ 4
n−3
f (v n+3 +2i ) = f (u n+3 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n−5
f (v n+5 +2i ) = f (u n+5 +2i ) = 3, 1 ≤ i ≤ 4
2 2
and f (u n+3 ) = f (u n+5 ) = f (v n+5 ) = 3. The Table 2 gives the vertex and edge condition of f .
2 2 2
Table 2
3b
b2
1b b
2 b
b 4 b4
1 b
2
1 b b3
4b
b
b3 2b
4b 2
b
3 b
b 4
1
Figure 1
Proof It is clear that D2 (K1,n ) has 2n + 2 vertices and 4n edges. Let V (D2 (K1,n )) =
{u, v, ui , vi : 1 ≤ i ≤ n} and E(D2 (K1,n )) = {uui , vvi , vui , uvi : 1 ≤ i ≤ n}.
Let n = 2t + 1. Suppose there exists a 4-prime cordial labeling g, then vg (1) = vg (2) =
vg (3) = vg (4) = t + 1.
Proof Let V (S ′ (Pn )) = {ui , vi : 1 ≤ i ≤ n} and E(S ′ (Pn )) ={ui ui+1 ,ui vi+1 ,vi ui+1 : 1 ≤
i ≤ n − 1}. Clearly S ′ (Pn ) has 2n vertices and 3n − 3 edges. Figure 2 shows that S ′ (P2 ), S ′ (P3 )
are 4-prime cordial.
1 3b 4b 2b 3b
b
b b b b b
2 4 2 4 1
Figure 2
n
f (v2i ) = f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n
f (v2i+1 ) = f (u2i ) = 4, 1 ≤ i ≤ 4
n−4
f (v n+2 +2i ) = f (u n+2 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n−4
f (v n+4 +2i ) = f (u n+4 +2i ) = 3, 1 ≤ i ≤ 4
2 2
n 3n−4 3n−2
In this case vf (1) = vf (2) = vf (3) = vf (4) = 2, and ef (0) = 2 , ef (1) = 2 .
n+3
f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n−1
f (u2i ) = 4, 1 ≤ i ≤ 4
n+3
f (v2i−1 ) = 4, 1 ≤ i ≤ 4
n−1
f (v2i ) = 2, 1 ≤ i ≤ 4
n−1
f (v n−1 +2i ) = f (u n−1 +2i ) = 3, 1 ≤ i ≤ 4
2 2
n−1
f (v n+1 +2i ) = f (u n+1 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n+2
f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n+2
f (u2i ) = 4, 1 ≤ i ≤ 4
n−2
f (v2i ) = 2, 1 ≤ i ≤ 4
n−2
f (v2i+1 ) = 4, 1 ≤ i ≤ 4
n−2
f (v n2 +2i ) = f (u n2 +2i ) = 3, 1 ≤ i ≤ 4
n−2
f (v n+2 +2i ) = f (u n+2 +2i ) = 1, 1 ≤ i ≤ 4
2 2
n 3n−4 3n−2
Here vf (1) = vf (2) = vf (3) = vf (4) = 2, and ef (0) = 2 , ef (1) = 2 .
Construct a vertex labeling f from the vertices of S ′ (Pn ) to the set {1, 2, 3, 4} by f (un ) = 1,
f (vn ) = 3,
n+1
f (v2i ) = f (u2i−1 ) = 2, 1 ≤ i ≤ 4
n+1
f (v2i−1 ) = f (u2i ) = 4, 1 ≤ i ≤ 4
n−3
f (v n−1 +2i ) = f (u n−1 +2i ) = 3, 1 ≤ i ≤ 4
2 2
n−3
f (v n+1 +2i ) = f (u n+1 +2i ) = 1, 1 ≤ i ≤ 4
2 2
Proof Let V (S ′ (K1,n )) = {u, v, ui , vi : 1 ≤ i ≤ n} and E(S ′ (K1,n )) = {uui , vui , uvi : 1 ≤
i ≤ n}. Clearly S ′ (K1,n ) has 2n + 2 vertices and 3n edges. The Figure 3 shows that S ′ (K1,2 )
is a 4-prime cordial graph.
132 R.Ponraj, Rajpal Singh and R.Kala
4 b 1b
b
2
2b b
3
b
3
Figure 3
Table 3
Next we investigate the 4-prime cordial behavior of degree splitting graph of a star. Let
G = (V, E) be a graph with V = S1 ∪ S2 ∪ · · · ∪ St ∪ T where each Si is a set of vertices having at
S
t
least two vertices and having the same degree and T = V − Si . The degree splitting graph
i=1
of G denoted by DS (G) is obtained from G by adding vertices w1 , w2 · · · , wt and joining wi to
each vertex of Si (1 ≤ i ≤ t).
Proof Let V (Bn,n ) = {u, v, ui , vi : 1 ≤ i ≤ n} and E(Bn,n ) = {uv, uui , vvi : 1 ≤ i ≤ n}.
Let V (DS(Bn,n )) = V (Bn,n ) ∪ {w1 , w2 } and E(DS(Bn,n )) = E(Bn,n ) ∪ {w1 ui , w1 vi , w2 u, w2 v :
1 ≤ i ≤ n}. Clearly DS(Bn,n ) has 2n + 4 vertices and 4n + 3 edges.
Case 1. n ≡ 1 (mod 4).
Let n = 4t + 1. Assign the label 3 to the vertices v1 , v2 , · · · , v2t+1 and 1 to the vertices
v2t+2 , v2t+3 , · · · , v4t+1 . Next assign the label 4 to the vertices u1 , u2 , · · · , u2t+2 and 2 to the
vertices u2t+3 , u2t+4 , · · · , u4t+1 . Finally, assign the labels 1, 2, 2 and 2 to the vertices w2 , u, v
and w1 respectively.
Case 2. n ≡ 3 (mod 4).
As in case 1 assign the labels to the vertices ui , vi , u, v, w1 and w2 (1 ≤ i ≤ n − 2). Next
Some New Families of 4-Prime Cordial Graphs 133
assign the labels 1, 3, 2 and 4 respectively to the vertices vn−1 , vn , un−1 and un . The Table 4
establishes that this vertex labeling f is a 4-prime cordial labeling. 2
Nature of n vf (1) vf (2) vf (3) vf (4) ef (0) ef (1)
4t + 1 2t + 1 2t + 2 2t + 1 2t + 2 8t + 3 8t + 4
4t + 3 2t + 2 2t + 3 2t + 2 2t + 3 8t + 7 8t + 8
Table 4
Proof Let V (J(n, n)) = {u, v, ui , vi , w1 , w2 : 1 ≤ i ≤ n} and E(J(n, n)) ={uui , vui , uw1 ,
w1 v, vw2 , uw2 , w1 w2 : 1 ≤ i ≤ n}. Note that J(n, n) has 2n + 4 vertices and 2n + 5 edges.
Proof Let m = n + r, r ≥ 0. Use of the labeling f given in theorem ?? assign the label to
the vertices u, v, w1 , w2 , ui , vi (1 ≤ i ≤ n).
References
[1] I.Cahit, Cordial Graphs: A weaker version of Graceful and Harmonious graphs, Ars com-
bin., 23 (1987) 201-207.
[2] J.A.Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics,
17 (2015) #Ds6.
[3] F.Harary, Graph theory, Addision wesley, New Delhi (1969).
[4] M.A.Seoud and M.A.Salim, Two upper bounds of prime cordial graphs, JCMCC, 75(2010)
95-103.
[5] M.Sundaram, R.Ponraj and S.Somasundaram, Prime cordial labeling of graphs, J. Indian
Acad. Math., 27(2005) 373-390.
[6] M. Sundaram, R. Ponraj and S. Somasundaram, Product cordial labeling of graphs, Bull.
Pure and Appl. Sci. (Math. & Stat.), 23E (2004) 155-163.
[7] R.Ponraj, Rajpal singh, R.Kala and S. Sathish Narayanan, k-prime cordial graphs, J. Appl.
Math. & Informatics, 34 (3-4) (2016) 227 - 237.
[8] R.Ponraj, Rajpal singh and S. Sathish Narayanan, 4-prime cordiality of some classes of
graphs, Journal of Algorithms and Computation, 48(1)(2016), 69- 79.
[9] R.Ponraj, Rajpal singh and S. Sathish Narayanan, 4-prime cordiality of some cycle related
graphs, Applications and Applied Mathematics, 12(1)(2016), 230-240.
[10] R.Ponraj and Rajpal singh, 4-Prime cordial graphs obtained from 4-Prime cordial graphs,
Bulletin of International Mathematical Virtual Institute, 8(1)(2018), 1-9.
Some New Families of 4-Prime Cordial Graphs 135
[11] R.Ponraj, Rajpal singh and R.Kala, 4-Prime cordiality of some special graphs, Bulletin of
International Mathematical Virtual Institute, 8(1)(2018), 89-97.
[12] R.Ponraj, Rajpal singh and R.Kala, Some more 4-Prime cordial graphs, International
Journal of Mathematical Combinatorics, 2 (2017) 105-115.