Lucas Gracefulness of Almost and Nearly For Some Graphs

International J.Math. Combin. Vol.
3 (2011), 88-106
Lucas Gracefulness of Almost and Nearly for Some Graphs
M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Department of Mathematics, National Engineering College,
K.R.Nagar, Kovilpatti, Tamil Nadu, India
E-mail: meetperumal.ma@gmail.com, snk.voc@gmail.com, nagarajan.voc@gmail.com
Abstract: Let G be a (p, q) - graph. An injective function f : V (G)
{l0, l1, l2, , la}, (a N), is said to be Lucas graceful labeling if an induced edge la-
beling f1(uv) = |f(u) f(v)| is a bijection onto the set {l1, l2, , lq} with the as-
sumption of l0 = 0, l1 = 1, l2 = 3, l3 = 4, l4 = 7, l5 = 11, etc.. If G admits Lu-
cas graceful labeling, then G is said to be Lucas graceful graph. An injective function
f : V (G) {l0, l1, l2, , la1, la+1}, (a N), is said to be almost Lucas graceful la-
beling if the induced edge labeling f1(uv) = |f(u) f(v)| is a bijection onto the set
{l1, l2, , lq}or{l1, l2, , lq1, lq+1} with the assumption of l0 = 0, l1 = 1, l2 = 3, l3 =
4, l4 = 7, l5 = 11, etc.. Then G is called almost Lucas graceful graph if it admits almost
Lucas graceful labeling. Also, an injective function f : V (G) {l0, l1, l2, , la}, (a N), is
said to be nearly Lucas graceful labeling if the induced edge labeling f1(u, v) = |f(u) f(v)|
onto the set {l1, l2, , li1, li+1, li+2, , lj1, lj+1, lj+2, , l
k1
, l
k+1
, l
k+2
, , l
b
(b N
and b a) with the assumption of l0 = 0, l1 = 1, l2 = 3, l3 = 4, l4 = 7, l5 = 11, etc.. If G
admits nearly Lucas graceful labeling, then G is said to be nearly Lucas graceful graph. In
this paper, we show that the graphs Sm,n, Sm,n@Pt and Fm@Pn are almost Lucas graceful
graphs. Also we show that the graphs Sm,n@Pt and Cn are nearly Lucas graceful graphs.
Key Words: Smarandache-Fibonacci triple, super Smarandache-Fibonacci graceful graph,
graceful labeling, Lucas graceful labeling, almost Lucas graceful labeling and nearly Lucas
graceful labeling.
AMS(2010): 05C78
1. Introduction
By a graph, we mean a nite undirected graph without loops or multiple edges. A cycle of
length n is denoted by C
n
G
+
is a graph obtained from the graph G by attaching pendant
vertex to each vertex of G. The concept of graceful labeling was introduced by Rosa [3] in 1967.
A function f is called a graceful labeling of a graph G with q edges if f is an injection from
the vertices of G to the set {1, 2, 3, , q} such that when each edge uv is assigned the label
1
Received May 26, 2011. Accepted September 6, 2011.
Lucas Gracefulness of Almost and Nearly for Some Graphs 89
|f(u) f(v)|, the resulting edge labels are distinct. The notion of Fibonacci graceful labeling
was introduced by K.M.Kathiresan and S.Amutha [4]. We call a function f, a Fibonacci
graceful label labeling of a graph G with q edges if f is an injection from the vertices of
G to the set {0, 1, 2, , F
q
}, where F
q
is the q
th
Fibonacci number of the Fibonacci series
F
1
= 1, F
2
= 2, F
3
= 3, F
4
= 5, and each edge uv is assigned the label |f(u) f(v)|. Based
on the above concept we dene the following.
A Smarandache-Fibonacci triple is a sequence S(n), n 0 such that S(n) = S(n
1) + S(n 2), where S(n) is the Smarandache function for integers n 0. Clearly, it is a
generalization of Fibonacci sequence and Lucas sequence. Let G be a (p, q)-graph and {S(n)|n
0} a Smarandache-Fibonacci triple. An bijection f : V (G) {S(0), S(1), S(2), . . . , S(q)} is
said to be a super Smarandache-Fibonacci graceful graph if the induced edge labeling f
(uv) =
|f(u) f(v)| is a bijection onto the set {S(1), S(2), . . . , S(q)}. Particularly, if S(n), n 0 is
just the Lucas sequence, such a labeling f : V (G) {l
0
, l
1
, l
2
, , l
a
} (a N) is said to be
Lucas graceful labeling if the induced edge labeling f
1
(uv) = |f(u) f(v)| is a bijection on to
the set {l
1
, l
2
, , l
q
}. If G admits Lucas graceful labeling, then G is said to be Lucas graceful
graph. An injective function f : V (G) {l
0
, l
1
, l
2
, , l
a1
, l
a+1
}, (a N), is said to be almost
Lucas graceful labeling if the induced edge labeling f
1
(uv) = |f(u) f(v)| is a bijection onto the
set {l
1
, l
2
, , l
q
} or {l
1
, l
2
, , l
q1
, l
q+1
} with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
=
4, l
4
= 7, l
5
= 11, etc.. Then G is called almost Lucas graceful graph if it admits almost Lucas
graceful labeling. Also, an injective function f : V (G) {l
0
, l
1
, l
2
, , l
a
}, (a N), is said to
be nearly Lucas graceful labeling if the induced edge labeling f
1
(u, v) = |f(u) f(v)| onto the
set {l
1
, l
2
, , l
i1
, l
i+1
, l
i+2
, , l
j1
, l
j+1
, l
j+2
, , l
k1
, l
k+1
, l
k+2
, , l
b
(b N and b a)
with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
= 4, l
4
= 7, l
5
= 11, etc.. If G admits nearly
Lucas graceful labeling, then G is said to be nearly Lucas graceful graph. In this paper, we
show that the graphs S
m,n
, S
m,n
@P
t
and F
m
@P
n
are almost Lucas graceful graphs. Also we
show that the graphs S
m,n
@P
t
and C
n
are nearly Lucas graceful graphs.
2. Almost Lucas Graceful Graphs
In this section, we show that some graphs namely S
m,n
, S
m,n
@P
t
and F
m
@P
n
are almost Lucas
graceful graphs.
Denition 2.1 Let G be a (p, q) - graph. An injective function f : V (G) {l
0
, l
1
, l
2
, , l
a1
,
l
a+1
}, a N, is said to be almost Lucas graceful labeling if the induced edge labeling f
1
(uv) =
|f(u) f(v)| is a bijection onto the set {l
1
, l
2
, , l
q
} or {l
1
, l
2
, , l
q1
, l
q+1
}. Then G is
called almost Lucas graceful graph if it admits almost Lucas graceful labeling.
Denition 2.2 ([2]) S
m,n
denotes a star with n spokes in which each spoke is a path of length
m.
Theorem 2.3 S
m,n
is an almost Lucas graceful graph when m 1(mod 2) and n 0(mod 3)
Proof Let G = S
m,n
. Let V (G) = {u
i,j
: 1 i m and 1 j n} be the vertex set of
90 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
G. Let E(G) = {u
0
u
i,1
: 1 i m} {u
i,j
u
i,j+1
: 1 i m, 1 j n 1} be the edge set
of G. So, |V (G)| = mn + 1 and |E(G)| = mn. Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
} , a N by
f(u
0
) = l
0
. For i = 1, 2, , m 2 and i 1(mod 2), f(u
i,j
) = l
n(i1)+2j1
, 1 j n. For
i = 1, 2, , m 1 and i 0(mod 2), f(u
i,j
) = l
ni+22j
, 1 j n. For s = 1, 2, ,
n 3
3
f(u
m,j
) = l
(m1)n+2(j+1)3s
, 3s2 j 3s. and for s =
n
3
, f(u
m,j
) = l
(m1)n+2(j+1)3s
, 3s
2 j 3s 1. We claim that the edge labels are distinct. Let
E
1
=
m
_
i=1
i1(mod 2)
{f
1
(u
0
u
i,1
)} =
m
_
i=1
i1(mod 2)
{|f(u
0
) f(u
i,1
)|}
=
m
_
i=1
i1(mod 2)
_
l
0
l
n(i1)+1
_
=
m
_
i=1
i1(mod 2)
_
l
n(i1)+1
_
=
_
l
1
, l
2n+1
, l
4n+1
, , l
(m1)n+1
_
,
E
2
=
m
_
i=1
i0(mod 2)
{f
1
(u
0
u
i,1
)} =
m
_
i=1
i0(mod 2)
{|f(u
0
) f(u
i,1
)|}
=
m
_
i=1
i0(mod 2)
{|l
0
l
ni
|} =
m
_
i=1
i0(mod 2)
{l
ni
}
=
_
l
2n
, l
4n
, ..., l
(m1)n
_
,
E
3
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
i,j+1
)} =
m2
_
i=1
i1(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
|}
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
_
l
n(i1)+2j1
l
n(i1)+2j+1
_
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
_
l
n(i1)+2j
_
=
m2
_
i=1
i1(mod 2)
_
l
n(i1)+2
, l
n(i1)+4
, , l
n(i1)+2n2
_
= {l
2
, l
4
, , l
2n2
}
_
{l
2n+2
, l
2n+4
, , l
4n2
}
_

_
_
l
(m3)n+2
, l
(m3)n+4
, , l
(m3)n+2n2
_
=
_
l
2
, l
4
, , l
2n2
, l
2n+4
, , l
4n2
, , l
(m3)n+2
, l
(m3)n+4
, , l
mnn2
_
,
E
4
=
m1
_
i=1
i0(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
ij+1
)} =
m1
_
i=1
i0(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
)|}
=
m1
_
i=1
i0(mod 2)
n1
_
j=1
{|l
ni2j+2
l
ni2j
|} =
m1
_
i=1
i0(mod 2)
n1
_
j=1
{l
ni2j+1
}
=
m1
_
i=1
i0(mod 2)
n1
_
j=1
{l
ni1
, l
ni3
, , l
ni2n+3
}
= {l
2n1
, l
2n3
, , l
3
}
_
{l
4n1
, l
4n3
, , l
2n+3
}
_

_
_
l
(m1)n1
, l
(m1)n3
, , l
mn3n+3
_
=
_
l
2n1
, l
2n3
, , l
3
, l
4n1
, l
4n3
, , l
2n+3
, , l
(m1)n1
, l
(m1)n3
, , l
mn3n+3
_
,
E
5
=
n3
3
_
s=1
{f
1
(u
m,j
u
m,j+1
) : 3s 2 j 3s 1}
=
n3
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
)| : 3s 2 j 3s 1}
=
n3
3
_
s=1
_
l
n(m1)+2j3s+2
l
n(m1)+2j3s+4
: 3s 2 j 3s 1
_
=
n3
3
_
s=1
_
l
n(m1)+2j3s+3
: 3s 2 j 3s 1
_
=
_
l
n(m1)+2
, l
n(m1)+4
_
_
_
l
n(m1)+5
, l
n(m1)+7
_
_

_
_
l
n(m1)+2n10n+3+3
, l
n(m1)+2n8n+3+3
_
=
_
l
n(m1)+2
, l
n(m1)+4
, l
n(m1)+5
, l
n(m1)+7
, , l
n(m1)+n4
, l
n(m1)+n2
_
= {l
n(m1)+2
, l
n(m1)+4
, l
n(m1)+5
, l
n(m1)+7
, , l
mn4
, l
mn2
}.
We nd the edge labeling between the end vertex of s
th
loop and the starting vertex of (s+1)
th
loop and s = 1, 2, ,
n 3
3
. Let
E
6
=
n3
3
_
s=1
{f
1
(u
m,j
u
m,j+1
) : j = 3s} =
n3
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
) : j = 3s|}
= {|f(u
m,3
) f(u
m,4
)| , |f(u
m,6
) f(u
m,7
)| , , |f(u
m,n3
) f(u
m,n2
)|}
=
_
l
(m1)n+83
l
(m1)n+106
l
(m1)n+146
l
(m1)n+169
,
,
l
(m1)n+2n4n+3
l
(m1)n+2n2n
_
=
_
l
(m1)n+5
l
(m1)n+4
l
(m1)n+8l
l
(m1)
n + 7
, ,
l
(m1)n+n1
l
(m1)n+n2
_
= {|l
(m1)n+3
, l
(m1)n+6
, , l
(m1)n+n3
|}
=
_
l
(m1)n+3
, l
(m1)n+6
, , l
mn3
_
.
For s =
n
3
, let
E
7
= {f
1
(u
m,j
u
m,j+1
) : 3s 2 j 3s 1} = {|f(u
m,j
) f(u
m,j+1
)| : 3s 2 j 3s 1}
=
_
l
(m1)n+2n2n
l
(m1)n+2nn
l
(m1)n+2nn
l
(m1)n+2n+2n
_
=
_
l
(m1)n+n2
l
(m1)n+n
l
(m1)n+n
l
(m1)n+n+2
_
=
_
l
(m1)n+n1
, l
(m1)n+n+1
_
= {l
mn1
, l
mn+1
} .
Now, E =
7
i=1
E
i
= {l
1
, l
2
, ..., l
mn1
, l
mn+1
}. So, the edge labels of G are distinct. Therefore, f
is an almost Lucas graceful labeling. Thus G = S
m,n
is an almost Lucas graceful graph, when
m 1(mod 2) and n 0(mod 3).
Example 2.4 An almost Lucas graceful labeling of S
7,9
is shown in Fig.2.1.
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
15
l
17
l
18
l
16
l
14
l
12
l
10
l
8
l
6
l
4
l
2
l
19
l
21
l
23
l
25
l
27
l
29
l
31
l
33
l
35
l
36
l
34
l
32
l
30
l
28
l
26
l
24
l
22
l
20
l
37
l
39
l
41
l
43
l
45
l
47
l
49
l
51
l
53
l
54
l
52
l
50
l
48
l
46
l
44
l
42
l
40
l
38
l
55
l
57
l
59
l
58
l
60
l
62
l
61
l
63
l
65
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
16
l
17
l
15
l
13
l
11
l
9
l
7
l
5
l
3
l
20
l
22
l
24
l
26
l
28
l
30
l
32
l
34
l
35
l
33
l
31
l
29
l
27
l
25
l
23
l
21
l
38
l
40
l
42
l
44
l
46
l
48
l
50
l
52
l
53
l
51
l
49
l
47
l
45
l
43
l
41
l
39
l
56
l
58
l
57
l
59
l
61
l
60
l
62
l
64
l
0
l
1
l
18
l
19
l
36
l
37
l
54
l
55
Fig.2.1 S
7,9
Denition 2.5([2]) The graph G = S
m,n
@P
t
consists of S
m,n
and a path P
t
of length t which
is attached with the maximum degree of the vertex of S
m,n
.
Theorem 2.6 S
m,n
@P
t
is an almost Lucas graceful graph when m 0(mod 2) and t
0(mod 3).
Proof Let G = S
m,n
@P
t
with m 0(mod 3) and t 0(mod 3). Let
V (G) = {u
0
, u
i,j
: 1 i m and 1 j n}
_
{v
k
: 1 k t} ,
E(G) = {u
0
u
i,1
: 1 i m}
_
{u
i,j
u
ij+1
: 1 i m and 1 j n 1}
_
{u
0
v
1
}
_
{v
k
v
k+1
: 1 k t 1}
be the vertex set and edge set of G, respectively. Thus |V (G)| = mn+t+1 and |E(G)| = mn+t.
Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
} , a N by f(u
0
) = l
0
. For i = 1, 2, , m and for
i 1(mod 2), f(u
i,j
) = l
n(i1)+2j1
, 1 j n. For i = 1, 2, , m and for i 1(mod 2),
f(u
i,j
= l
ni2j+2
, 1 j n. For s = 1, 2, ,
t 3
3
, f(v
k
) = l
mn+2k3s+2
, 3s 2 k 3s
and for s =
t
3
, f(v
k
) = l
mn+2k3s+2
, 3s 2 k 3s 1. We claim that the edge labels are
distinct. Let
E
1
=
m
_
i=1
i1(mod 2)
{f
1
(u
0
u
i,1
)}
=
m
_
i=1
i1(mod 2)
{|f(u
0
) f(u
i,1
)|} =
m
_
i=1
i1(mod 2)
_
l
0
l
n(i1)+1
_
=
m
_
i=1
i1(mod 2)
_
l
n(i1)+1
_
=
_
l
1
, l
2n+1
, l
4n+1
, , l
n(m1)+1
_
,
E
2
=
m
_
i=1
i1(mod 2)
{f
1
(u
0
u
i,1
)} =
m
_
i=1
i1(mod 2)
{|f(u
0
) f(u
i,1
)|}
=
m
_
i=1
i1(mod 2)
{|l
0
l
ni
|} =
m
_
i=1
i1(mod 2)
{l
ni
} = {l
2n
, l
4n
, , l
mn
} ,
E
3
=
m
_
i=1
i1(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
i,j+1
)} =
m
_
i=1
i1(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
)|}
=
m
_
i=1
i1(mod 2)
n1
_
j=1
_
l
n(i1)+2j1
l
n(i1)+2j+1
_
=
m
_
i=1
i1(mod 2)
n1
_
j=1
_
l
n(i1)+2j
_
=
m
_
i=1
i1(mod 2)
_
l
n(i1)+2
, l
n(i1)+4
, , l
n(i1)+2n2
_
= {l
2
, l
4
, , l
2n2
}
_
{l
2n+2
, l
2n+4
, , l
4n2
}
_

_
_
l
n(m2)+2
, l
n(m2)+4
, , l
mn2
_
= {l
2
, l
4
, , l
2n2
, l
2n+2
, l
2n+4
, , l
4n2
, , l
n(m2)+2
, l
n(m2)+4
, , l
mn2
},
E
4
=
m
_
i=1
i1(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
i,j+1
)} =
m
_
i=1
i1(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
)|}
=
m
_
i=1
i1(mod 2)
n1
_
j=1
{|l
ni2j+2
l
ni2j
|}
=
m
_
i=1
i1(mod 2)
n1
_
j=1
{l
ni2j+1
} =
m
_
i=1
i0(mod 2)
{l
ni1
, l
ni3
, , l
ni2n+3
}
= {l
2n1
, l
2n3
, , l
3
} {l
4n1
, l
4n3
, ..., l
2n+3
} ... {l
mn1
, l
mn3
, , l
mn2n+3
}
= {l
2n1
, l
2n3
, , l
3
, l
4n1
, l
4n3
, , l
2n+3
, , l
mn1
, l
mn3
, , l
mn2n+3
},
E
1
= {f
1
(u
0
v
1
)} = {|f(u
0
) f(v
1
)|} = {|l
0
l
mn+1
|} = {l
mn+1
},
E
2
=
t3
3
_
s=1
{f
1
(v
k
v
k+1
) : 3s 2 k 3s 1}
=
t3
3
_
s=1
{|f(v
k
) f(v
k+1
) : 3s 2 k 3s 1|}
=
t3
3
_
s=1
{|l
mn+2k+23s
l
mn+2k+43s
| : 3s 2 k 3s 1}
=
t3
3
_
s=1
{l
mn+2k+33s
: 3s 2 k 3s 1}
= {l
mn+2
, l
mn+4
} {l
mn+5
, l
mn+7
} {l
mn+t4
, l
mn+t2
}
= {l
mn+2
, l
mn+4
, l
mn+5
, l
mn+7
, , l
mn+t4
, l
mn+t2
}
th
th
loop for integers s = 1, 2, ,
t 3
3
. Let
E
3
=
t3
3
_
s=1
{f
1
(u
3s
u
3s+1
)}
= {|f(u
3s
) f(u
3s+1
)|}
=
_
|f(u
3
) f(u
4
)| , |f(u
6
) f(u
7
)| , ...,
f
(t3)
f
(t2)
_
= {|l
mn+83
l
mn+106
| , |l
mn+146
l
mn+169
| , ..., |l
mn+2t4t+3
l
mn+2t2t
|}
= {|l
mn+5
l
mn+4
| , |l
mn+8
l
mn+7
| , ..., |l
mn+t1
l
mn+t2
|}
= {l
mn+3
, l
mn+6
, ..., l
mn+t3
} .
For s =
t
3
, let
E
4
= {f
1
(v
k
v
k+1
) : 3s 2 k 3s 1}
= {|f(v
k
) f(v
k+1
)| : 3s 2 k 3s 1}
= {|l
mn+2t4+2t
l
mn+2t2+2t
| , |l
mn+2t2+2t
l
mn+2t+2t
|}
= {|l
mn+t2
l
mn+t+2
| |l
mn+t
l
mn+t+1
|} = {l
mn+t1
, l
mn+t+1
} .
Now, E =
4
i=1
(E
i
i
) = {l
1
, l
2
, , l
mn
, , l
mn+t1
, l
mn+t+1
}. So, the edge labels of G are
distinct. Therefore, f is an almost Lucas graceful graph. Thus G = S
m,n
@P
t
is an almost
Lucas graceful graph when m 0(mod 2) and t 0(mod 3).
Example 2.7 An almost Lucas graceful labeling on S
4,7
@P
6
l
0
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
15
l
17
l
19
l
21
l
23
l
25
l
27
l
16
l
18
l
20
l
22
l
24
l
26
l
28
l
28
l
29
l
31
l
33
l
32
l
34
l
36
l
29
l
30
l
32
l
31
l
33
l
35
l
2
l
4
l
6
l
8
l
10
l
12
l
13
l
11
l
9
l
7
l
5
l
3
l
26
l
24
l
22
l
20
l
18
l
16
l
27
l
25
l
23
l
21
l
19
l
17
l
15
l
14
l
1
Fig.2.2 S
4,7
@P
6
Denition 2.8([2]) The graph G = F
m
@P
n
consists of a fan F
m
and a path P
n
of length n
which is attached with the maximum degree of the vertex of F
m
.
Theorem 2.9 F
m
@P
n
is almost Lucas graceful graph when n 0(mod 3).
Proof Let v
1
, v
2
, , v
m+1
and u
0
be the vertices of a Fan F
m
. Let u
1
, u
2
, , u
n
be the
vertices of a path P
n
. Let G = F
m
@P
n
, |V (G)| = m +n + 2 and |E(G)| = 2m +n + 1. Dene
f : V (G) {l
0
, l
1
, l
2
, , l
q+2
by f(u
0
) = l
0
; f(v
i
) = l
2i1
; f(u
j
) = l
2m+2j3s+3
, 3s 2 j
3s. We claim that the edge labels are distinct. Let
E
1
=
m
_
i=1
{f
1
(v
i
v
i+1
)} =
m
_
i=1
{|f(v
i
) f(v
i+1
)|}
=
m
_
i=1
{|l
2i1
l
2i+1
|}
=
m
_
i=1
{l
2i
} = {l
2
, l
4
, ..., l
2m
} ,
E
2
=
m+1
_
i=1
{f
1
(u
0
v
i
)} =
m+1
_
i=1
{|f(u
0
) f(v
i
)|}
=
m+1
_
i=1
{|l
0
l
2i1
|} =
m+1
_
i=1
{l
2i1
} = {l
1
, l
3
, ..., l
2m+1
} ,
E
3
= {f
1
(u
0
u
1
)} = {|f(u
0
) f(u
1
)|} = {|l
0
l
2m+2
|} = {l
2m+2
} ,
E
4
=
n3
3
_
s=1
{f
1
(u
j
u
j+1
) : 3s 2 j 3s 1}
=
n3
3
_
s=1
{|f(u
j
) f(u
j+1
)| : 3s 2 j 3s 1}
= {|f(u
1
) f(u
2
)| , |f(u
2
) f(u
3
)|}
_
{|f(u
4
) f(u
5
)| , |f(u
5
) f(u
6
)|}
_

_
{|f(u
n5
) f(u
n4
)| , |f(u
n4
) f(u
n3
)|}
= {|l
2m+2
l
2m+4
| , |l
2m+4
l
2m+6
|}
_
{|l
2m+5
l
2m+7
| , |l
2m+7
l
2m+9
|}
_

_
{|l
2m+2n10+3n+3
l
2m+2n8+3n+3
| , |l
2m+2n8+3n+3
l
2m+2n6+3n+3
|}
= {l
2m+3
, l
2m+5
} {l
2m+6
, l
2m+8
} {l
2m+n3
, l
2m+n1
}
= {l
2m+3
, l
2m+5
, l
2m+6
, l
2m+8
, , l
2m+n3
, l
2m+n1
} .
th
th
loop for s = 1, 2, ,
n
3
1. Let
E
5
=
n
3
1
_
s=1
{f
1
(u
j
u
j+1
) : j = 3s} =
n
3
1
_
s=1
{|f(u
j
) f(u
j+1
)| : j = 3s}
= {|l
2m+6+33
l
2m+8+36
| , |l
2m+12+36
l
2m+14+39
| ,
, |l
2m+2n6+3n+3
l
2m+2n4+3n
|}
= {|l
2m+6
l
2m+5
| , |l
2m+9
l
2m+8
| , |l
2m+n
l
2m+n1
|}
= {l
2m+4
, l
2m+7
, , l
2m+n2
} .
For s =
n
3
, let
E
6
= {f
1
(u
j
u
j+1
) : 3s 2 j 3s 1}
= {|f(u
j
) f(u
j+1
)| : 3s 2 j 3s 1}
= {|f(u
n2
) f(u
n1
)| , |f(u
n1
) f(u
n
)|}
= {|l
2m+2n4+3n
l
2m+2n2+3n
| , |l
2m+2n2+3n
l
2m+2n+3n
|}
= {|l
2m+n1
l
2m+n+1
| , |l
2m+n+1
l
2m+n+3
|}
= {l
2m+n
, l
2m+n+2
} .
Now, E =
6
i=1
E
i
= {l
1
, l
2
, , l
2m
, l
2m+1
, l
2m+2
, , l
2m+n2
, l
2m+n1
, l
2m+n
, l
2m+n+2
}. So,
the edge labels of G are distinct. Therefore, f is an almost Lucas graceful labeling.
Thus G = F
m
@P
n
is an almost Lucas graceful graph when n 0(mod 3).
Example 2.10 An almost Lucas graceful labeling on F
5
@P
6
l
1
l
3
l
5
l
7
l
9
l
11
l
0
l
12
l
14
l
16
l
15
l
2
l
4
l
6
l
8
l
10
l
12
l
13
l
15
l
14
l
1
l
3
l
5
l
7
l
9
l
11
l
17
l
19
l
16
l
18
Fig.2.3 F
5
@P
6
3. Nearly Lucas Graceful Graphs
In this section, we show that the graphs S
m,n
@P
t
and C
n
are nearly Lucas graceful graphs.
Denition 3.1 Let G be a (p, q) - graph. An injective function f : V (G) {l
0
, l
1
, l
2
, , l
a
},
(a N), is said to be nearly Lucas graceful labeling if the induced edge labeling f
1
(u, v) = |f(u)
f(v)| onto the set {l
1
, l
2
, , l
i1
, l
i+1
, l
i+2
, , l
j1
, l
j+1
, l
j+2
, , l
k1
, l
k+1
, l
k+2
, , l
b
(b N
and b a) with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
= 4, l
4
= 7, l
5
= 11, etc.. If G admits
nearly Lucas graceful labeling, then G is said to be nearly Lucas graceful graph.
Theorem 3.2 S
m,n
@P
t
is a nearly Lucas graceful graph when n 1, 2(mod 3) m 1(mod 2)
and t = 1, 2(mod 3)
Proof Let G = S
m,n
@P
t
with V (G) = {u
0
, u
i,j
: 1 i m and 1 j n}{v
k
: 1 k t}.
Let E(G) = {u
0
u
i,j
: 1 i m}
{u
i,j
u
i,j+1
: 1 i m and 1 j n}
{u
0
v
1
}{v
k
v
k+1
:
1 k t 1} be the edge set of G. So, |V (G)| = mn + t + 1 and |E(G)| = mn + t.
Dene f : V (G) {l
0
, l
1
, , l
a
}, a N by f(u
0
) = l
0
. For i = 1, 2, , m and for
i 1(mod 2) f(u
i,j
) = l
n(i1)+2j1
, 1 j n. For i = 1, 2, , m and for i 0(mod 2),
f(u
i,j
) = l
in2j+2
, 1 j n. For s = 1, 2, ,
n 2
3
1 or s = 1, 2, ,
n 1
3
1 or
s = 1, 2, 3, ,
n
3
1, f(u
m,j
) = l
mn+2(j+1)3s
, 3s 2 j 3s. For s =
n 2
3
or
n 1
3
or
n
3
, f(u
m,j
= l
mn+2(j+1)3s
, 3s 2 j 3s 1. For r = 1, 2, ,
t 2
3
or r = 1, 2, ,
t 1
3
or r = 1, 2, 3, ,
t
3
, f(v
k
) = l
mn+2k+33r
, 3r 2 j 3r 1. We claim that the edge labels
are distinct. Let
E
1
=
m
_
i=1
i1(mod 2)
{f
1
(u
0
u
i,1
} =
m
_
i=1
i1(mod 2)
{|f(u
0
) f(u
i,j
)|}
=
m
_
i=1
i1(mod 2)
_
l
0
l
(i1)n+1
_
=
m
_
i=1
i1(mod 2)
_
l
(i1)n+1
_
=
_
l
1
, l
2n+1
, , l
(m1)n+1
_
,
E
2
=
m
_
i=1
i0(mod 2)
{f
1
(u
0
u
i,1
)} =
m
_
i=1
i0(mod 2)
{|f(u
0
) f(u
i,1
)|}
=
m
_
i=1
i0(mod 2)
{l
0
l
in
} =
m
_
i=1
i0(mod 2)
{l
in
} =
_
l
2n
, l
4n
, , l
(m1)n
_
,
E
3
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
i,j+1
)} =
m2
_
i=1
i1(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
)|}
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
_
l
(i1)n+2j1
l
(i1)n+2j+1
_
=
m2
_
i=1
i1(mod 2)
n1
_
j=1
_
l
(i1)n+2j
_
=
m2
_
i=1
i1(mod 2)
_
l
(i1)n+2
, l
(i1)n+4
, , l
(i1)n+2n2
_
= {l
2
, l
4
, , l
2n2
}
_
{l
2n+2
, l
2n+4
, , l
4n2
}
_

_
_
l
(m3)n+2
, l
(m3)n+4
, , l
mnn2
_
=
_
l
2
, l
4
, , l
2n2
, l
2n+2
, l
2n+4
, , l
4n2
, , l
(m3)+2
, l
(m3)n+4
, , l
mnn2
_
,
E
4
=
m1
_
i=1
i0(mod 2)
n1
_
j=1
{f
1
(u
i,j
u
i,j+1
)} =
m1
_
i=1
i0(mod 2)
n1
_
j=1
{|f(u
i,j
) f(u
i,j+1
)|}
=
m1
_
i=1
i0(mod 2)
n1
_
j=1
{|l
ni2j+2
l
ni2j
|} =
m1
_
i=1
i0(mod 2)
n1
_
j=1
{l
ni2j+1
}
=
m1
_
i=1
i0(mod 2)
{l
in1
, l
in3
, , l
in2n+3
}
= {l
2n1
, l
2n3
, , l
3
}
_
{l
4n1
, l
4n3
, , l
2n+3
}
_

_
_
l
(m1)n1
, l
(m1)n3
, , l
mn3n+3
_
=
_
l
2n1
, l
2n3
, , l
4n1
, l
4n3
, , l
2n+3
, , l
(m1)n1
, l
(m1)n3
, , l
mn3n+3
_
.
For n 1(mod 3) and s = 1, 2, ,
n 4
3
, let
E
5
=
n4
3
_
s=1
{f
1
(u
m,j
u
m,j+1
) : 3s 2 j 3s 1}
=
n4
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
)| : 3s 2 j 3s 1}
=
n4
3
_
s=1
_
l
(m1)n+2j3s+2
l
(m1)n+2j3s+4
: 3s 2 j 3s 1
_
=
n4
3
_
s=1
_
l
(m1)n+2j3s+3
: 3s 2 j 3s 1
_
=
_
l
(m1)n+2
, l
(m1)n+4
_
_
l
(m1)n+5
, l
(m1)n+7
_
...
_
l
(m1)n+n4
, l
(m1)n+n2
_
=
_
l
(m1)n+2
, l
(m1)n+4
, l
(m1)n+5
, l
(m1)n+7
, ..., l
mn4
, l
mn2
_
.
th
th
n 4
3
. Let
E
6
=
n1
3
_
s=1
{f
1
(u
m,j
u
m,j+1
) : j = 3s} =
n1
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
)| : j = 3s}
= {|f(u
m,3
) f(u
m,4
)| , |f(u
m,6
) f(u
m,7
)| , , |f(u
m,n1
) f(u
m,n
)|}
=
_
l
(m1)n+5
l
(m1)n+4
l
(m1)n+7
, ,
l
(m1)n+2n2n+1
l
(m1)n+2n+2n2
_
=
_
l
(m1)n+3
, l
(m1)n+6
, , l
mn1
_
.
For s =
n 1
3
, Let
E
7
= {f
1
(u
m,j
u
m,j+1
) : 3s 2 j 3s 1}
= {|f(u
m,j
) f(u
m,j+1
)| : 3s 2 j 3s 1}
=
_
l
(m1)n+2n6+2n+1
l
(m1)n+2n4+2n+1
l
(m1)n+2n4+2n+1
l
(m1)n+2n2+2n+1
_
= {|l
mn3
l
mn1
| , |l
mn1
l
mn+1
|} = {l
mn2
, l
mn
}
Now, E =
7
i=1
E
i
= {l
1
, l
2
, , l
mn
}. For n 2(mod 3) and integers s = 1, 2, ,
n 2
3
,
E
1
=
n2
3
_
s=1
{f
1
(u
m,j
u
m,j+1
) : 3s 2 j 3s 1}
=
n2
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
)| : 3s 2 j 3s 1}
=
n2
3
_
s=1
_
l
(m1)n+2j+23s
l
(m1)n+2j+43s
: 3s 2 j 3s 1
_
=
n2
3
_
s=1
_
l
(m1)n+2j+33s
: 3s 2 j 3s 1
_
=
_
l
(m1)n+2
, l
(m1)n+4
_
_
l
(m1)n+5
, l
(m1)n+7
_
...
_
l
(m1)n+n3
, l
(m1)n+n1
_
=
_
l
(m1)n+2
, l
(m1)n+4
, l
(m1)n+5
, l
(m1)n+7
, , l
mn3
, l
mn1
_
th
loop and the starting vertex of s +1
th
n 2
3
. Let
E
2
=
n2
3
_
s=1
{f
1
(u
m,j
u
m,j+1
)j = 3s} =
n2
3
_
s=1
{|f(u
m,j
) f(u
m,j+1
)| : j = 3s}
= {|f(u
m,3
) f(u
m,4
)| , |f(u
m,6
) f(u
m,7
)| , , |f(u
m,n2
) f(u
m,n1
|}
=
_
l
(m1)n+83
l
(m1)n+106
l
(m1)n+146
l
(m1)n+169
,
,
l
(m1)n+2n2n+2
l
(m1)n+2nn1
_
=
_
l
(m1)n+5
l
(m1)n+4
l
(m1)n+8
l
(m1)n+7
,
,
l
(m1)n+n
l
(m1)n+n1
_
=
_
l
(m1)n+3
, l
(m1)n+6
, , l
mn2
_
.
For s =
n + 1
3
, let
E
3
= {f
1
(u
m,j
u
m,j+1
) : j = 3s 2} = {|f(u
m,j
) f(u
m,j+1
)| : j = n 1}
= {|f(u
m,n1
) f(u
m,n
)|} =
_
l
(m1)n+2nn1
l
(m1)n+2n+2n1
_
= {|l
mn1
l
mn+1
|} = {l
mn
} .
Therefore, E
=
3
i=1
E
i
. Let
E
0
= {f
1
(u
0
v
1
)} = {|f(u
0
) f(v
1
)|} = {|l
0
l
mn+2
|} = {l
mn+2
} .
For t 2(mod 3) and r = 1, 2, ,
t 2
3
, let
E
1
=
t2
3
_
r=1
{f
1
(v
k
v
k+1
) : 3r 2 k 3r 1}
=
t2
3
_
r=1
{|f(v
k
) f(v
k+1
)| : 3r 2 k 3r 1}
= {|f(v
1
) f(v
2
)| , |f(v
2
) f(v
3
)|}
_
{|f(v
4
) f(v
5
)| , |f(v
5
) f(v
6
)|}
_

_
{|f(v
t4
) f(v
t3
)| , |f(v
t3
) f(v
t2
)|}
= {|l
mn+3+23
l
mn+3+43
|, |l
mn+3+43
l
mn+3+63
|}
_
{|l
mn+8+36
l
mn+10+36
| , |l
mn+10+36
l
mn+12+36
|}
_

_
{|l
mn+3+2t8t+2
l
mn+3+2t6t+2
| , |l
mn+3+2t6t+2
l
mn+3+2t4t+2
|}
= {|l
mn+2
l
mn+4
|, |l
mn+4
l
mn+6
|}
_
{|l
mn+5
l
mn+7
| , |l
mn+7
= l
mn+9
|}
_

_
{|l
mn+t3
l
mn+t1
| , |l
mn+t1
l
mn+t+1
|}
= {l
mn+3
, l
mn+5
}
_
{l
mn+6
, l
mn+8
}
_

_
{l
mn+t2
, l
mn+t
}
= {l
mn+3
, l
mn+5
, l
mn+6
, l
mn+8
, , l
mn+t2
, l
mn+t
}.
We nd the edge labeling between the end vertex of r
th
loop and the starting vertex of (r +1)
th
loop for integers r = 1, 2, ,
t 2
3
. Let
E
2
=
t2
3
_
r=1
{f
1
(v
k
v
k+1
) : k = 3r} =
t2
3
_
r=1
{|f(v
k
) f(v
k+1
)| : k = 3r}
= {|f(v
3
) f(v
4
)| , |f(v
6
) f(v
7
)| , , |f(v
t2
) f(v
t1
)|}
= {|l
mn+3+63
l
mn+3+86
| , |l
mn+3+126
l
mn+3+149
| ,
, |l
mn+3+2t4t+2
l
mn+3+2t2t1
|}
= {|l
mn+6
l
mn+5
| , |l
mn+9
l
mn+8
| , ..., |l
mn+t+1
l
mn+t
|}
= {l
mn+4
, l
mn+7
, , l
mn+t1
} .
For s =
t + 1
3
, let
E
3
= {f
1
(v
k
v
k+1
) : k = 3r 2} = {|f(v
k
) f(v
k+1
)| : k = 3r 2}
= {|l
mn+3+2t2t1
l
mn+3+2tt1
|} = {|l
mn+t
l
mn+t+2
|} = {l
mn+t+1
}
Therefore, E = E
0
3
= {l
mn+2
, l
mn+3
, l
mn+5
, l
mn+6
, l
mn+8
, , l
mn+t2
, l
mn+t
,
l
mn+t+1
, l
mn+4
, l
mn+7
, , l
mn+t1
}. Now, E
=
7
i=1
E
i
E
0
E
1
E
2
E
3
= {l
1
, l
2
, ,
l
mn
, l
mn+2
, l
mn+3
, l
mn+4
, , l
mn+t2
, l
mn+t1
, l
mn+t
, l
mn+t+1
}. So, the edge labels of G are
distinct. For t 1(mod 3) and integers r = 1, 2, ,
t 1
3
, let
E
1
=
t1
3
_
r=1
{f
1
(v
k
v
k+1
) : 3r 2 k 3r 1}
=
t1
3
_
r=1
{|f(v
k
) f(v
k+1
)| : 3r 2 k 3r 1}
= {|f(v
1
) f(v
2
)| , |f(v
2
) f(v
3
)|}
_
{|f(v
4
) f(v
5
)| , |f(v
5
) f(v
6
)|}
_

_
{|f(v
t3
) f(v
t2
)| , |f(v
t2
) f(v
t1
)|}
= {|l
mn+3+23
l
mn+3+43
| , |l
mn+3+43
l
mn+3+63
|}
_
{|l
mn+3+86
l
mn+3+106
| , |l
mn+3+106
l
mn+3+126
|}
_

_
{|l
mn+3+2t6t+1
l
mn+3+2t4t+1
| , |l
mn+3+2t4t+1
l
mn+3+2t2t+1
| }
= {|l
mn+2
l
mn+4
| , |l
mn+4
l
mn+6
|}
_
{|l
mn+5
l
mn+7
| , |l
mn+7
l
mn+9
|}
_

_
{|l
mn+t2
l
mn+t
| , |l
mn+t
l
mn+t+2
|}
= {l
mn+3
, l
mn+5
, l
mn+6
, l
mn+8
, , l
mn+t1
, l
mn+t+1
} .
We nd the edge labeling between the end vertex of r
th
loop and the starting vertex of (r +1)
th
loop for integers r = 1, 2, ,
t 1
3
. Let
E
2
=
t1
3
_
r=1
{f
1
(v
k
v
k+1
) : k = 3r}
=
t1
3
_
r=1
{|f(v
k
) f(v
k+1
)| : k = 3r}
= {|f(v
3
) f(v
4
)| , |f(v
6
) f(v
7
)| , , |f(v
t1
) f(v
t
)|}
= {|l
mn+3+63
l
mn+3+86
| , , |l
mn+3+2t2t+1
l
mn+3+2tt2
|}
= {|l
mn+6
l
mn+5
| , |l
mn+9
l
mn+8
| , ..., |l
mn+t+2
l
mn+t+1
|}
= {l
mn+4
, l
mn+7
, , l
mn+t
}
Therefore E
= E
0
2
= {l
mn+2
, l
mn+3
, , l
mn+t1
, l
mn+t+1
, l
mn+4
, l
mn+7
, ,
l
mn+t
} = {l
mn+2
, l
mn+3
, l
mn+4
, , l
mn+t1
, l
mn+t
, l
mn+t+1
}. Now, E E
=
4
i=1
E
i
_
3
i=1
E
i
_
_
E
0
2
_
= {l
1
, l
2
, , l
mn
, l
mn+2
, l
mn+3
, , l
mn+t1
, l
mn+t
, l
mn+t+1
}.
So, the edge labels of G are distinct. In both cases, f is a nearly Lucas graceful labeling. Thus
G = S
m,n
@P
t
is a nearly Lucas graceful graph when m 1(mod 2), n 1, 2(mod 3) and
t 1, 2, (mod 3).
Example 3.3 A nearly Lucas graceful labeling of S
5,7
@P
7
l
13
l
11
l
9
l
7
l
5
l
3
l
1
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
27
l
25
l
23
l
21
l
19
l
17
l
15
l
16
l
18
l
20
l
22
l
24
l
26
l
28
l
35
l
36
l
34
l
32
l
33
l
31
l
29
l
34
l
35
l
33
l
31
l
32
l
30
l
29
l
0
l
37
l
39
l
41
l
40
l
42
l
44
l
43
l
37
l
38
l
40
l
39
l
41
l
43
l
42
l
17
l
19
l
21
l
23
l
25
l
27
l
28
l
26
l
24
l
22
l
20
l
18
l
16
l
15
l
3
l
5
l
7
l
9
l
11
l
13
l
14
l
1
l
12
l
10
l
8
l
6
l
4
l
2
Fig.3.1 S
5,7
@P
7
Theorem 3.4 C
n
is a nearly Lucas graceful graph. when n 1, 2(mod 3).
Proof Let G = C
n
with V (G) = {u
i
: 1 i n}. Let E(G) = {u
i
u
i+1
: 1 i n 1}
{u
n
u
1
} be the edge set of G. So, |V (G)| = n and |E(G)| = n.
Case 1 n 1(mod 3).
Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
} , a N by f(u
1
) = l
0
. For s = 1, 2, ,
n 4
3
,
f(u
i
) = l
2i3s
, 3s 1 i 3s + 1 and for s =
n 1
3
, f(u
i
) = l
2i3s
, 3s 1 i 3s. We
claim that the edge labels are distinct. Let
E
1
= {f
1
(u
1
u
2
), f
1
(u
n
u
1
)} = {|f(u
1
) f(u
2
)| , |f(u
n
f(u
1
)|}
= {|l
0
l
1
| , |l
2nn+1
l
0
|} = {l
1
, l
n+1
} .
For s = 1, 2, ,
n 1
3
, let
E
2
=
n1
3
_
s=1
{f
1
(u
i
u
i+1
) 3s 1 i 3s}
=
n1
3
_
s=1
{|f(u
i
) f(u
i+1
)| : 3s 1 i 3s}
= {|f(u
2
) f(u
3
)| , |f(u
3
) f(u
4
)|}
_
{|f(u
5
) f(u
6
)| , |f(u
6
) f(u
7
)|}
_

_
{|f(u
n2
) f(u
n1
)| , |f(u
n1
) f(u
n
)|}
= {|l
1
l
3
| , |l
3
l
5
|}
_
{|l
4
l
6
| , |l
6
l
8
|}
_

_
{|l
2n4n+1
l
2n2n+1
| , |l
2n2n+1
l
2nn+1
|}
= {l
2
, l
4
}
_
{l
5
, l
7
}
_
{l
n2
, l
n
} .
th
th
n 1
3
1. Let
E
3
=
n4
3
_
s=1
{f
1
(u
i
u
i+1
) : i = 3s + 1}
=
n4
3
_
s=1
{|f(u
i
) f(u
i+1
)| : i = 3s + 1}
= {|f(u
4
) f(u
5
)| , |f(u
7
) f(u
8
)| , , |f(u
n3
f(u
n2
)|}
= {|l
83
l
106
| , |l
146
l
169
| , , |l
2n6n+4
l
2n4n+1
|}
= {|l
5
l
4
| , |l
8
l
7
| , , |l
n2
l
n3
|} = {l
3
, l
6
, , l
n4
}
Now, E =
3
i=1
E
i
= {l
1
, l
2
, l
3
, l
4
, , l
n2
, l
n
, l
n+1
}.
Case 2 n 2(mod 3).
Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
}, a N by f(u
1
) = l
0
, f(u
n
) = l
n+2
. For s =
1, 2, ,
n 2
3
1, f(u
i
) = l
2i3s
, 3s1 i 3s+1 and for s =
n 2
3
, f(u
i
) = l
2i3s
, 3s1
i 3s. We claim that the edge labels are distinct. Let
E
1
= {f
1
(u
1
u
2
), f
1
(u
n1
u
n
), f
1
(u
n
u
1
)}
= {|f(u
1
) f(u
2
)| , |f(u
n1
) f(u
n
)| , |f(u
n
) f(u
1
)|}
= {|l
0
l
1
| , |l
2n2n+2
l
n+2
| , |l
n+2
l
0
|} = {l
1
, l
n+1
, l
n+2
} ,
E
2
=
n2
3
_
s=1
{f
1
(u
i
u
i+1
) : 3s 1 i 3s}
=
n2
3
_
s=1
{|f(u
i
) f(u
i+1
)| : 3s 1 i 3s}
= {|f(u
2
) f(u
3
)| , |f(u
3
) f(u
4
)|}
_
{|f(u
5
) f(u
6
)| , |f(u
6
) f(u
7
)|}
_

_
{|f(u
n3
) f(u
n2
)| , |f(u
n2
) f(u
n1
)|}
= {|l
43
l
63
| , |l
63
l
83
|}
_
{|l
106
l
126
| , |l
126
l
146
|}
_

_
{|l
2n6n+2
l
2n4n+2
|}
= {|l
1
l
3
| , |l
3
l
5
|}
_
{|l
4
l
6
| , |l
6
l
8
|}
_

_
{|l
n4
l
n2
| , |l
n2
l
n
|}
= {l
2
, l
4
, l
5
, l
7
, ..., l
n3
, l
n1
} .
We nd the edge labeling between the end vertex of (s 1)
th
loop and the starting vertex of
s
th
n 5
3
. Let
E
3
=
n5
3
_
s=1
{f
1
(u
i
u
i+1
) : i = 3s + 1}
=
n5
3
_
s=1
{|f(u
i
) f(u
i+1
)| : i = 3s + 1}
= {|f(u
4
) f(u
5
)| , |f(u
7
) f(u
8
)| , ..., |f(u
n4
) f(u
n3
)|}
= {|l
5
l
4
| , |l
8
l
7
| , , |l
2n8n+5
l
2n6n+2
|} = {l
3
, l
6
, , l
n2
}
Now, E =
3
i=1
E
i
= {l
1
, l
2
, l
3
, l
4
, , l
n3
, l
n2
, l
n1
, l
n+1
, l
n+2
} So, all these edge labels of G
are distinct. In both the cases, f is a nearly Lucas graceful graph. Thus G = C
n
is a nearly
Lucas graceful graph when n 1, 2(mod 3).
Example 3.5 A nearly Lucas graceful labeling on C
13
in Case 1 is shown in Fig.3.2.
l
0
l
1
l
3
l
5
l
4
l
6
l
8
l
7
l
9
l
11
l
10
l
12
l
14
l
1
l
2
l
4
l
3
l
5
l
7
l
6 l
8
l
10
l
9
l
11
l
13
l
14
Fig.3.2 C
13
Example 3.6 A nearly Lucas graceful labeling on C
14
in Case 2 is shown in Fig.3.3.
l
0
l
1
l
3
l
5
l
4
l
6
l
8
l
7
l
9
l
11
l
10
l
12
l
14
l
16
l
1
l
2
l
4
l
3
l
5
l
7
l
6
l
8
l
10
l
9
l
11
l
13
l
15
l
16
Fig.3.3 C
14
References
[1] David M.Burton, Elementary Number Theory (Sixth Edition), Tata McGraw - Hill Edition,
Tenth reprint 2010.
[2] G.A.Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics,
16(2009) # DS 6, pp 219.
[3] A.Rosa, On certain valuations of the vertices of a graph, Theory of Graphs International
Symposium, Rome, 1966.
[4] K.M.Kathiresan and S.Amutha, Fibonacci Graceful Graphs, Ph.D., Thesis, Madurai Ka-
maraj University, October 2006.
[5] M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan, Lucas Graceful Labeling for Some
Graphs, International J. Mathematical Combinatorics, Vol.1, 2011, pp. 1-19.

Lucas Gracefulness of Almost and Nearly For Some Graphs

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Lucas Gracefulness of Almost and Nearly For Some Graphs

Caricato da

Copyright:

Formati disponibili

International J.Math. Combin. Vol.

Potrebbero piacerti anche