International J.Math. Combin. Vol.

1 (2011), 01-19
Lucas Graceful Labeling for Some Graphs
M.A.Perumal
1
, S.Navaneethakrishnan
2
and A.Nagarajan
2
1. Department of Mathematics, National Engineering College,
K.R.Nagar, Kovilpatti, Tamil Nadu, India
2. Department of Mathematics, V.O.C College, Thoothukudi, Tamil Nadu, India.
Email : meetperumal.ma@gmail.com, snk.voc@gmail.com, nagarajan.voc@gmail.com
Abstract: 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 grace-
ful 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 label-
ing f : V (G) {l0, l1, l2, , la} (a N) is said to be Lucas graceful labeling if the induced
edge labeling f1(uv) = |f(u) f(v)| is a bijection on to the set {l1, l2, , lq}. Then G is
called Lucas graceful graph if it admits Lucas graceful labeling. Also an injective function
f : V (G) {l0, l1, l2, , lq} is said to be strong Lucas graceful labeling if the induced edge
labeling f1(uv) = |f(u) f(v)| is a bijection onto the set {l1, l2, ..., lq}. G is called strong
Lucas graceful graph if it admits strong Lucas graceful labeling. In this paper, we show
that some graphs namely Pn, P
+
n
e, Sm,n, Fm@Pn, Cm@Pn, K1,n 2Pm, C3@2Pn and
Cn@K1,2 admit Lucas graceful labeling and some graphs namely K1,n and Fn admit strong
Lucas graceful labeling.
Key Words: Smarandache-Fibonacci triple, super Smarandache-Fibonacci graceful graph,
Lucas graceful labeling, strong Lucas graceful labeling.
AMS(2010): 05C78
1. Introduction
By a graph, we mean a nite undirected graph without loops or multiple edges. A path of
length n is denoted by P
n
. A cycle of length n is denoted by C
n
.G
+
is a graph obtained from
the graph G by attaching a pendant vertex to each vertex of G. The concept of graceful labeling
was introduced by Rosa [3] in 1967.
A function f is a graceful labeling of a graph G with q edges if f is an injection from
1
Received November 11, 2010. Accepted February 10, 2011.
2 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
the vertices of G to the set {1, 2, 3, , q} such that when each edge uv is assigned the la-
bel |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, a Fi-
bonacci graceful 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 concepts we dene the following.
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 Lucas graceful labeling if an induced edge labeling f
1
(uv) = |f(u) f(v)| is a
bijection onto the set {l
1
, l
2
, , l
q
} with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
= 4, l
4
=
7, l
5
= 11, ,. Then G is called Lucas graceful graph if it admits Lucas graceful labeling. Also
an injective function f : V (G) {l
0
, l
1
, l
2
, , l
q
} is said to be strong 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
}. Then
G is called strong Lucas graceful graph if it admits strong Lucas graceful labeling. In this paper,
we show that some graphs namely P
n
, P
+
n
e, S
m,n
, F
m
@P
n
, C
m
@P
n
, K
1,n
2P
m
, C
3
@2P
n
and C
n
@K
1,2
admit Lucas graceful labeling and some graphs namely K
1,n
and F
n
admit strong
Lucas graceful labeling. Generally, let S(n), n 0 with S(n) = S(n 1) + S(n 2) be a
Smarandache-Fibonacci triple, where S(n) is the Smarandache function for integers n 0. 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)}.
2. Lucas graceful graphs
In this section, we show that some well known graphs are 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
a
, },
(a N) is said to be Lucas graceful labeling if an induced edge labeling f
1
(uv) = |f(u) f(v)| is
a bijection onto the set {l
1
, l
2
, , l
q
} with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
= 4, l
4
=
7, l
5
= 11, ,. Then G is called Lucas graceful graph if it admits Lucas graceful labeling.
Theorem 2.2 The path P
n
is a Lucas graceful graph.
Proof Let P
n
be a path of length n having (n+1) vertices namely v
1
, v
2
, v
3
, , v
n
, v
n+1
.
Now, |V (P
n
)| = n + 1 and |E(P
n
)| = n. Dene f : V (P
n
) {l
0
, l
1
, l
2
, , l
a
, }, a N by
f(u
i
) = l
i+1
, 1 i n. Next, we claim that the edge labels are distinct. Let
E = {f
1
(v
i
v
i+1
) : 1 i n} = {|f(v
i
) f(v
i+1
)| : 1 i n}
= {|f(v
1
) f(v
2
)| , |f(v
2
) f(v
3
)| , , |f(v
n
) f(v
n+1
)| , }
= {|l
2
l
3
| , |l
3
l
4
| , , |l
n+1
l
n+2
|} = {l
1
, l
2
, , l
n
}.
So, the edges of P
n
receive the distinct labels. Therefore, f is a Lucas graceful labeling.
Hence, the path P
n
is a Lucas graceful graph.
Lucas Graceful Labeling for Some Graphs 3
Example 2.3 The graph P
6
admits Lucas graceful Labeling, such as those shown in Fig.1
following.
l
2
l
3
l
4
l
5
l
6
l
7
l
8
l
1
l
2
l
3
l
4
l
5
l
6
Fig.1
Theorem 2.4 P
+
n
e, (n 3) is a Lucas graceful graph.
Proof Let G = P
+
n
e with V (G) = {u
1
, u
2
, , u
n+1
}

{v
2
, v
3
, , v
n+1
} be the vertex
set of G. So, |V (G)| = 2n + 1 and |E(G)| = 2n. Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
, }, a N,
by
f(u
i
) = l
2i1
, 1 i n + 1 and f(v
j
) = l
2(j1)
, 2 j n + 1.
We claim that the edge labels are distinct. Let
E
1
= {f
1
(u
i
u
i+1
) : 1 i n} = {|f(u
i
) f(u
i+1
)| : 1 i n}
= {|f(u
1
) f(u
2
)|, |f(u
2
) f(u
3
)|, , |f(u
n
) f(u
n+1
)|}
= {|l
1
l
3
|, |l
3
l
5
|, , |l
2n1
l
2n+1
|} = {l
2
, l
4
, , l
2n
},
E
2
= {f
1
(u
i
v
j
) : 2 i, j n}
= {|f(u
2
) f(v
2
)|, |f(u
3
) f(v
3
)|, , |f(u
n+1
) f(v
n+1
)|}
= {|l
3
l
2
|, |l
5
l
4
|, , |l
2n+1
l
2n
|} = {l
1
, l
3
, , l
2n1
}.
Now, E = E
1
E
2
= {l
1
, l
3
, , l
2n1
, l
2n
}. So, the edges of G receive the distinct labels.
Therefore, f is a Lucas graceful labeling. Hence, P
+
n
e, (n 3) is a Lucas graceful graph.
Example 2.5 The graph P
+
8
e admits Lucas graceful labeling, such as thsoe shown in Fig.2.
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
15
l
17
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
16
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
15
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
16
Fig.2
Denition 2.6([2]) Denote by S
m,n
such a star with n spokes in which each spoke is a path of
length m.
Theorem 2.7 The graph S
m,n
is a Lucas graceful graph when m is odd and n 1, 2(mod 3).
4 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Proof Let G = S
m,n
and let V (G) =
_
u
i
j
: 1 i m and 1 j n
_
be the vertex set of
S
m,n
. Then |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, , m2 and i 1(mod 2);
f
_
u
i
j
_
= l
n(i1)+2j1
, 1 j n for i = 1, 2, , m1 and i 0(mod 2);
f
_
u
i
j
_
= l
ni+22j
, 1 j n and for s = 1, 2, ,
n
3
,
f
_
u
m
j
_
= l
n(m1)+2(j+1)3s
, 3s 2 j 3s.
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
=
m1
_
i=1
i1(mod 2)
_
f
1
_
u
0
u
i
1
__
=
m1
_
i=1
i1(mod 2)
_

f (u
0
) f
_
u
i
1
_

_
=
m1
_
i=1
i1(mod 2)
{|l
0
l
ni
|} =
m1
_
i=1
i1(mod 2)
{l
ni
} =
_
l
2n
, l
4n
, , l
n(m1)
_
E
3
=
m2
_
i=1
i1(mod 2)
_
f
1
_
u
i
j
u
i
j+1
_
: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
_

f
_
u
i
j
_
f
_
u
i
j+1
_

: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
_

l
n(i1)+2j1
l
n(i1)+2j+1

: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
_
l
n(i1)+2j
: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
_
l
n(i1)+2
, l
n(i1)+4
, , : l
n(i1)+2(n1)
_
=
_
l
2
, l
2n+2
, ..., l
n(m3)+2
_

_
l
4
, l
2n+4
, , l
n(m3)+4
_

_
l
2n2
, l
4n2
, ..., l
n(m3)+2n2
_
,
Lucas Graceful Labeling for Some Graphs 5
E
4
=
m2
_
i=1
i1(mod 2)
_
f
1
_
u
i
j
u
i
j+1
_
: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
_

f
_
u
i
j
_
f
_
u
i
j+1
_

: 1 j n 1
_
=
m2
_
i=1
i1(mod 2)
{|l
ni2j+2
l
ni2j
| : 1 j n 1}
=
m2
_
i=1
i1(mod 2)
{l
ni2j+1
: 1 j n 1}
=
m2
_
i=1
i1(mod 2)
_
l
ni1
, l
ni3
, , l
ni(2n3)
_
=
_
l
2n1
, l
2n3
, , l
3
, l
4n1
, l
4n3
, , l
2n+3
, l
n(m1)1
, , l
n(m1)(2n3)
_
.
For n 1(mod 3), let
E
5
=
n1
3
_
s=1
_
f
1
_
u
m
j
u
m
j+1
_
: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_

f
_
u
m
j
_
f
_
u
m
j+1
_

: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_

l
n(m1)+2j3s+2
l
n(m1)+2j3s+4

: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_
l
n(m1)+2j3s+2
: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_
l
n(m1)+3s1
, l
n(m1)+3s+1
_
=
_
l
n(m1)+2
, l
n(m1)+4
, l
n(m1)+5
, l
n(m1)+7
, , l
n m2
, l
mn
_
.
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 1
3
. Let
E
6
=
n1
3
_
s=1
_

f
1
_
u
m
3s
u
m
3s+1
_

_
=
n1
3
_
s=1
_

f (u
m
3s
) f
_
u
m
3s+1
_

_
=
_
|f (u
m
3
) f (u
m
4
)| , |f (u
m
6
) f (u
m
7
)| , |f (u
m
9
) f (u
m
10
)| , ,

f
_
u
m
n1
_
f (u
m
n
)

_
=
_

l
n(m1)+5
l
n(m1)+4

l
n(m1)+8
l
n(m1)+7

, ,

l
n(m1)+n+1
l
n(m1)+n

_
=
_
l
n(m1)+3
, l
n(m1)+6
, , l
n(m1)+n1
_
=
_
l
n(m1)+3
, l
n(m1)+6
, , l
nm1
_
.
6 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
For n 2(mod 3), let
E

5
=
n1
3
_
s=1
_
f
1
_
u
m
j
u
m
j+1
_
: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_

f
_
u
m
j
_
f
_
u
m
j+1
_

: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_

l
n(m1)+2j3s+2
l
n(m1)+2j3s+4

: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_
l
n(m1)+2j3s+3
: 3s 2 j 3s 1
_
=
n1
3
_
s=1
_
l
n(m1)+3s1
, l
n(m1)+3s+1
_
=
_
l
n(m1)+2
, l
n(m1)+4
, l
n(m1)+5
, l
n(m1)+7
, , l
n(m1)+n2
, l
n(m1)+n
_
.
We determine the edge labeling between the end vertex of s
th
loop and the starting vertex
of (s + 1)
th
loop and s = 1, 2, 3, ...,
n 1
3
.
Let E

6
=
n1
3
_
s=1
_
f
1
_
u
m
3s
u
m
3s+1
__
=
n1
3
_
s=1
_

f (u
m
3s
) f
_
m
3s+1
_

_
=
_
|f (u
m
3
) f (u
m
4
)| , |f (u
m
6
) f (u
m
7
)| , |f (u
m
9
) f (u
m
10
)| , ,

f
_
u
m
n1
_
f (u
m
n
)

_
=
_

l
n(m1)+5
l
n(m1)+4

l
n(m1)+8
l
n(m1)+7

, ,

l
n(m1)+n+1
l
n(m1)+n

_
=
_
l
n(m1)+3
, l
n(m1)+6
, , l
nm1
_
.
Now,E =
6

i=1
E
i
if n 1(mod 3) and E =
_
6

i=1
E
i
_

6
if n 2(mod 3). So the
edges of S
m,n
(when m is odd and n 1, 2(mod 3)), receive the distinct labels. Therefore, f is
a Lucas graceful labeling. Hence, S
m,n
is a Lucas graceful graph if m is odd, n 1, 2(mod 3).

Example 2.8 The graphs S

5,4
and S
5,5
admit Lucas graceful labeling, such as those shown in
Fig.3 and Fig 4.
l
1
l
3
l
5
l
7
l
8
l
6
l
7
l
2
l
9
l
11
l
13
l
15
l
16
l
14
l
12
l
10
l
17
l
19
l
21
l
20
l
2
l
4
l
6
l
7
l
5
l
3
l
10
l
12
l
14
l
15
l
13
l
11
l
18
l
20
l
19
l
1
l
8
l
9
l
16
l
17
l
0
Fig.3
Lucas Graceful Labeling for Some Graphs 7
l
1
l
3
l
5
l
7
l
9
l
10
l
8
l
6
l
4
l
2
l
11
l
13
l
15
l
17
l
19
l
20
l
18
l
16
l
14
l
12
l
21
l
23
l
25
l
24
l
26
l
2
l
4
l
6
l
8
l
9
l
7
l
5
l
3
l
12
l
14
l
16
l
18
l
19
l
17
l
15
l
13
l
22
l
24
l
23
l
25
l
1
l
10
l
11
l
20
l
21
l
0
Fig.4
Denition 2.9([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.10 F
m
@P
n
is a Lucas graceful labeling when n 1, 2 (mod 3).
Proof Let v
1
, v
2
, ..., v
m
, v
m+1
and u
0
be the vertices of a fan F
m
and u
1
, u
2
, , u
n
be the
vertices of a path P
n
. Let G = F
m
@P
n
. Then |V (G)| = m + n + 2 and |E(G)| = 2m + n + 1.
Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
, }, a N, by f(u
0
) = l
0
, f(v
i
) = l
2i1
, 1 i m + 1.
For s = 1, 2, ,
n 1
3
or
n 2
3
according as n 1(mod 3) or n 2(mod 3), f(u
j
) =
l
2m+2j3s+3
, 3s 2 j 3s.
We claim that the edge labels are distinct. Let
E
1
= {f
1
(v
i
v
i+1
) : 1 i m} = {|f(v
i
) f (v
i+1
)| : 1 i m}
= {|l
2i1
l
2i+1
| : 1 i m}
= {l
2i
: 1 i m} = {l
2
, l
4
, , l
2m
} ,
E
2
= {f
1
(u
0
v
i
) : 1 i m + 1} = {|f(u
0
) f(v
i
)| 1 i m + 1}
= {|l
0
l
2i1
| : 1 i m + 1}
= {l
2i1
: 1 i m + 1} = {l
1
, l
3
, , l
2m+1
}
and
E
3
= {f
1
(u
0
u
1
)} = {|f(u
0
) f(u
1
)|} = {|l
0
l
2m+2
|} = {l
2m+2
}
8 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
For s = 1, 2, 3, ,
n 1
3
and n 1(mod 3), let
E
4
=
n1
3
_
s=1
{f
1
(u
j
, u
j+1
) : 3s 2 j 3s 1}
=
n1
3
_
s=1
{|f(u
j
) f(u
j+1
)| : 3s 2 j 3s 1}
=
n1
3
_
s=1
{|l
2m+2j+33s
l
2m+2j+53s
| : 3s 2 j 3s 1}
=
n1
3
_
s=1
(l
2m+2j+43s
: 3s 2 j 3s 1)
= {l
2m+2j2
: 4 j 5}
_
{l
2m+2j5
: 7 j 8}
_

_
{l
2m+2jn+4
: n 3 j n 2}
= {l
2m+6
, l
2m+8
} {l
2m+9
, l
2m+11
}
_

_
{l
2m+n2
, l
2m+n
}
= {l
2m+6
, l
2m+8
, l
2m+9
, l
2m+11
, , l
2m+n2
, l
2m+n
}
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, 3, ,
n 1
3
, n 1(mod 3). Let
E
5
=
n1
3
_
s=1
{f
1
(u
j
u
j+1
) : j = 3s} =
n1
3
_
s=1
{|f(u
j
) f(u
j+1
)| : j = 3s}
=
n1
3
_
s=1
{|l
2m+2j+33s
l
2m+2j+53s
| : j = 3s}
= {|l
2m+2j
l
2m+2j1
| : j = 3} {|l
2m+2j3
l
2m+2j4
| : j = 6}
_

_
{|l
2m+2j
l
2m+2j1
| : j = n 1}
= {l
2m+2j2
: j = 3} {l
2m+2j5
: j = 6} , , {l
2m+2jn+3
: j = n 1}
= {l
2m+4
, l
2m+7
, , l
2m+n+1
} .
For s = 1, 2, 3, ,
n 2
3
and n 2(mod 3), let
E

4
=
n2
3
_
s=1
{f
1
(u
j
u
j+1
) : 3s 2 j 3s 1}
=
n2
3
_
s=1
{|f(u
j
) f(u
j+1
)| : 3s 2 j 3s 1}
=
n2
3
_
s=1
{|l
2m+2j+33s
l
2m+2j+53s
| : 3s 2 j 3s 1}
Lucas Graceful Labeling for Some Graphs 9
=
n2
3
_
s=1
(l
2m+2j+43s
: 3s 2 j 3s 1)
= {l
2m+2j2
: 4 j 5}
_
{l
2m+2j5
: 7 j 8}
_

_
{l
2m+2jn+4
: n 3 j n 2}
= {l
2m+6
, l
2m+8
}
_
{l
2m+9
, l
2m+11
}
_

_
{l
2m+n2
, l
2m+n
}
= {l
2m+6
, l
2m+8
,
2m+9
, l
2m+11
, , l
2m+n2
, l
2m+n
}
We determine the edge labeling between the end vertex of s
th
loop and the starting vertex
of (s + 1)
th
loop and s = 1, 2, 3, ...,
n 2
3
, n 2(mod 3). Let
E

5
=
n2
3
_
s=1
{f
1
(u
j
, u
j+1
) : j = 3s}
=
n2
3
_
s=1
{|f(u
j
) f(u
j+1
)| : j = 3s} =
n2
3
_
s=1
{|l
2m+2j+33s
l
2m+2j+53s
| : j = 3s}
= {|l
2m+2j
l
2m+2j1
| : j = 3}
_
{|l
2m+2j3
l
2m+2j4
| : j = 6}
_

_
{|l
2m+2jn+4
l
2m+2jn+5
| : j = n 1}
= {l
2m+2j2
: j = 3} {l
2m+2j5
: j = 6}
_

_
_
l
2m+2j(n3)
: j = n 1
_
= {l
2m+4
, l
2m+7
, ..., l
2m+n+1
} .
Now, E =
5

i=1
E
i
if n 1(mod 3) and E =
_
5

i=1
E
i
_

5
if n 2(mod 3). So, the
edges of F
m
@P
n
(whenn 1, 2(mod 3)) are the distinct labels. Therefore, f is a Lucas graceful
labeling. Hence, G = F
m
@P
n
(if n 1, 2(mod 3)) is a Lucas graceful labeling.
Example 2.11 The graph F
5
@P
4
admits a Lucas graceful labeling shown in Fig.5.
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
Fig.5
Denition 2.12 ([2]) The Graph G = C
m
@P
n
consists of a cycle C
m
and a path of P
n
of
length n which is attached with any one vertex of C
m
.
10 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Theorem 2.13 The graph C
m
@P
n
is a Lucas graceful graph when m 0(mod 3) and n =
1, 2(mod 3).
Proof Let G = C
m
@P
n
and let u
1
, u
2
, , u
m
be the vertices of a cycle C
m
and v
1
, v
2
, , v
n
, v
n+1
be the vertices of a path P
n
which is attached with the vertex (u
1
= v
1
) of C
m
. Let V (G) =
{u
1
= v
1
} {u
2
, u
3
, , u
m
} {v
2
, v
3
, ..., v
n
, v
n+1
} be the vertex set of G. So, |V (G)| = m+n
and |E(G)| = m + n. Dene f : V (G) {l
0
, l
1
, , l
a
}, a N by f(u
1
) = f(v
1
) = l
0
; f(u
i
) =
l
2i3s
, 3s 1 j 3s + 1 for s = 1, 2, 3, ,
m
3
, i = 2, 3, , m; f(v
j
) = l
m+2j3r
, 3r 1
j 3r + 1 for r = 1, 2, ,
n + 1
3
and j = 2, 3, , n + 1.
We claim that the edge labels are distinct. Let
E
1
= {f
1
(u
1
u
2
)} = {|f (u
1
) f (u
2
)|} = (|l
0
l
1
|) = {l
1
},
E
2
=
m
3
_
s=1
{f
1
(u
i
u
i+1
) : 3s 1 i 3s and u
m+1
= u
1
}
=
m
3
_
s=1
{f
1
(u
i
) f(u
i+1
) : 3s 1 i 3s and u
m+1
= u
1
}
= {|f(u
2
) f(u
3
)| , |f(u
3
) f(u
4
)| , ..., |f(u
m
) f(u
m+1
)|}
= {|l
1
l
3
| , |l
3
l
5
| , |l
4
l
6
| , |l
6
l
8
| , , |l
m
l
0
|}
= {l
2
, l
4
, l
5
, l
7
, , l
m
}
We determine the edge labeling between the end vertex of s
th
loop and the starting vertex
of (s + 1)
th
loop and s = 1, 2, ...,
m
3
1. Let
E
3
=
m
3
1
_
s=1
{f
1
(u
3s+1
u
3s+2
)} =
m
3
1
_
s=1
{|f(u
3s+1
) f(u
3s+2
)|}
= {|f(u
4
) f(u
5
)| , |f(u
7
) f(u
8
)| , , |f(u
m2
) f(u
m1
)|}
= {|l
5
l
4
| , |l
8
l
7
| , , |l
m1
l
m2
|}
= {l
3
, l
6
, , l
m3
} ,
E
4
= {f
1
(v
1
v
2
)} = {|f(v
1
) f(v
2
)|} = {|l
0
l
m+43
|} {|l
0
l
m+43
|}
= {|l
0
l
m+1
|} = {|l
0
l
m+1
|} = {l
m+1
} .
For n 1(mod 3), let
E
5
=
n1
3
_
r=1
{f
1
(v
j
v
j+1
) : 3r 1 j 3r}
=
n1
3
_
r=1
{|f(v
j
) f(v
j+1
)| : 3r 1 j 3r}
Lucas Graceful Labeling for Some Graphs 11
= {|f(v
2
) f(v
3
)| , |f(v
3
) f(v
4
)| , , |f(v
n1
) f(v
n
)|}
= {|l
m+43
l
m+63
| , |l
m+63
l
m+83
| , |l
m+106
l
m+126
| , |l
m+126
l
m+146
| ,
, |l
m+2n2n+1
l
m+2nn+1
|}
= {|l
m+1
l
m+3
| , |l
m+3
l
m+5
| , |l
m+4
l
m+6
| , |l
m+6
l
m+8
| , , |l
m+n1
l
m+n+1
|}
= {l
m+2
, l
m+4
, l
m+5
, l
m+7
, , l
m+n
} .
We calculate the edge labeling between the end vertex of r
th
loop and the starting vertex
of (r + 1)
th
loop and r = 1, 2, ,
n 1
3
. Let
E
6
=
n1
3
_
r=1
{f
1
(v
3r+1
v
3r+2
)} =
n1
3
_
r=1
{|f(v
3r+1
) f(v
3r+2
)|}
= {|f(v
4
) f(v
5
)| , |f(v
7
) f(v
8
)| , , |f(v
n2
) f(v
n1
)|}
= {|l
m+83
l
m+106
| , |l
m+146
l
m+169
| , , |l
m+2n4n+2
l
m+2n2n+1
|}
= {|l
m+5
l
m+4
| , |l
m+8
l
m+7
| , , |l
m+n2
l
m+n
|}
= {l
m+3
, l
m+6
, l
m+9
, , l
m+n1
}
For n 2(mod 3), let
E

5
=
n1
3
_
r=1
{f
1
(v
j
v
j+1
) : 3r 1 j 3r} =
n1
3
_
r=1
{|f(v
j
) f(v
j+1
)| : 3r 1 j 3r}
= {|f(v
2
) f(v
3
)| , |f(v
3
) f(v
4
)| , , |f(v
n1
) f(v
n
)|}
= {|l
m+43
l
m+63
| , |l
m+63
l
m+83
| , |l
m+106
l
m+126
| , |l
m+126
l
m+146
| ,
, |l
m+2n22n+1
l
m+2nn+1
|}
= {l
m+2
, l
m+4
, l
m+5
, l
m+7
, ..., l
m+n
} .
We nd the edge labeling between the end vertex of r
th
loop and the starting vertex of
(r + 1)
th
loop and r = 1, 2, ,
n 2
3
. Let
E

6
=
n2
3
_
r=1
{f
1
(v
3r+1
v
3r+2
)} =
n2
3
_
r=1
{|f(v
3r+1
) f(v
3r+2
)|}
= {|f(v
4
) f(v
5
)| , |f(v
7
) f(v
8
)| , , |f(v
n2
) f(v
n1
)|}
= {|l
m+83
l
m+106
| , |l
m+146
l
m+169
| , , |l
m+2n4n+2
l
m+2n2n+1
|}
= {|l
m+5
l
m+4
| , |l
m+8
l
m+7
| , , |l
m+n2
l
m+n
|}
= {l
m+3
, l
m+6
, l
m+9
, , l
m+n1
}
Now, E =
6

i=1
E
i
if n 1(mod 3) and E =
_
4

i=1
E
i
_

6
if n 2(mod 3). So,
the edges of G receive the distinct labels. Therefore, f is a Lucas graceful labeling. Hence,
G = C
m
@P
n
is a Lucas graceful graph when m 0(mod 3) and n 1, 2(mod 3).
12 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Example 2.14 The graph C
9
@P
7
admits a Lucas graceful labeling, such as those shown in
Fig.6.
l
0
l
1
l
3
l
5
l
4 l
6
l
8
l
7
l
9
l
1
l
2
l
4
l
3
l
5
l
7
l
6
l
8
l
9
l
10
l
12
l
14
l
13
l
15
l
17
l
16
l
10
l
11
l
13
l
12
l
14
l
16
l
15
Fig.6
Denition 2.15 The graph K
1,n
2P
m
means that 2 copies of the path of length m is attached
with each pendent vertex of K
1,n
.
Theorem 2.16 The graph K
1,n
2P
m
is a Lucas graceful graph.
Proof Let G = K
1,n
2P
m
with V (G) = {u
i
: 0 i n}

_
v
(1)
ij
, v
(2)
i,j
: 1 i n, 1 j
m1} and E(G) = {u
0
u
i
: 1 i n}
_
u
i
v
(1)i,j
, u
i
v
(2)
i,j
: 1 i n and 1 j m1
_

_
v
(1)
i,j
v
(1)
i,j+1
, v
(2)
i,j
v
(2)
i,j+1
: 1 i n and 1 j m1
_
. Thus |V (G)| = 2mn + n + 1 and
|E(G)| = 2mn + n.
For i = 1, 2, , n, dene f : V (G) {l
0
, l
1
, l
2
, , l
a
} , a N, by f(u
0
) = l
0
f(u
i
) =
l
(2m+1)(i1)+2
; f(v
(1)
i,j
) = l
(2m+1)(i1)+2j+1
, 1 j m and f(v
(2)
i,j
) = l
(2m+1)(i1)+2j+2
, 1
j m.
We claim that the edge labels are distinct. Let
E
1
=
n
_
i=1
{f
1
(u
0
u
i
)} =
n
_
i=1
{|f (u
0
) f (u
i
)|}
=
n
_
i=1
_

l
0
l
(2m+1)(i1)+2

_
=
n
_
i=1
_
l
(2m+1)(i1)+2
_
,
E
2
=
n
_
i=1
_
f
1
(u
i
v
(1)
i,1
), f
1
(u
i
v
(2)
i,1
)
_
=
n
_
i=1
_

f(u
i
) f(v
(1)
i,1

f(u
i
) f(v
(2)
i,1
)

_
Lucas Graceful Labeling for Some Graphs 13
=
n
_
i=1
_

l
(2m+1)(i1)+2
l
(2m+1)(i1)+3

l
(2m+1)(i1)+2
l
(2m+1)(i1)+4

_
=
n
_
i=1
_
l
(2m+1)(i1)+1
, l
(2m+1)(i1)+3
_
= {l
1
, l
3
} {l
2m+2
, l
2m+4
} {l
2mn+n2m+1
, l
2mn+n2m+3
}
= {l
1
, l
2m+2
, , l
2mn+n2m+1
, l
3
, l
2m+4
, , l
2mn+n2m+3
} ,
E
3
=
n
_
i=1
_
_
_
m1
_
j=1
_
f
1
(v
(1)
i,j
v
(1)
i,j+1
_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_

f(v
(1)
i,j
) f(v
(1)
i,j+1

_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_

l
(2m+1)(i1)+2j+1
l
(2m+1)(i1)+2j+3

_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_
l
(2m+1)(i1)+2j+2
_
_
_
_
=
n
_
i=1
_
l
(2m+1)(i1)+4
, l
(2m+1)(i1)+6
, , l
(2m+1)(i1)+2m
_
= {l
4
, l
6
, , l
2m
}
_
l
(2m+1)+4
, l
(2m+1)+6
, , l
(2m+1)(i1)+2m
_
_

_
_
l
(2m+1)(n1)+4
, l
(2m+1)(n1)+6
, , l
(2m+1)(n1)+2m
_
=
_
l
4
, , l
2m
, l
2m+5
, , l
4m+1
, , l
(2m+1)(n1)+4
, l
(2m+1)(n1)+6
, , l
2mn+n1
_
,
E
4
=
n
_
i=1
_
_
_
m1
_
j=1
_
f
1
(v
(2)
i,j
v
(2)
i,j+1
_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_

f(v
(2)
i,j
) f(v
(2)
i,j+1

_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_

l
(2m+1)(i1)+2j+2
l
(2m+1)(i1)+2j+4

_
_
_
_
=
n
_
i=1
_
_
_
m1
_
j=1
_
l
(2m+1)(i1)+2j+3
_
_
_
_
=
n
_
i=1
_
l
(2m+1)(i1)+5
, l
(2m+1)(i1)+7
, , l
(2m+1)(i1)+2m+1
_
= {l
5
, , l
2m+1
}
_
{l
2m+1+5
, l
2m+1+7
, , l
2m+1+2m+1
}
_
_
l
(2m+1)(n1)+5
, l
(2m+1)(n1)+7
, , l
(2m+1)(n1)+(2m+1)
_
=
_
l
5
, , l
2m+1
, l
2m+6
, , l
4m+1
, , l
(2m+1)(n1)+5
, l
(2m+1(n1)+7
, , l
(2m+1)+n
_
.
14 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Now, E =
4

i=1
E
i
=
_
l
1
, l
2
, ..., l
(2m+1)n
_
. So, the edge labels of G are distinct. Therefore,
f is a Lucas graceful labeling. Hence, G = K
1,n
2P
m
is a Lucas graceful labeling.
Example 2.17 The graph K
1,4
2P
4
admits Lucas graceful labeling, such as those shown in
Fig.7.
l
3
l
5
l
7
l
9
l
4
l
6
l
8
l
10
l
12
l
14
l
16
l
18
l
13
l
15
l
17
l
19
l
21
l
23
l
25
l
27
l
28
l
26
l
24
l
22
l
30
l
32
l
34
l
36
l
31
l
33
l
35
l
37
l
2
l
11
l
20
l
29
l
4
l
6
l
8
l
5
l
7
l
9
l
13
l
15
l
17
l
14
l
16
l
18
l
22
l
24
l
26
l
27
l
25
l
23
l
31
l
33
l
35
l
36
l
34
l
32
l
1
l
3
l
10 l
12
l
19
l
21
l
28
l
30
l
2
l
11
l
20
l
29
l
0
Fig.7
Theorem 2.18 The graph C
3
@2P
n
is Lucas graceful graph when n 1(mod 3).
Proof Let G = C
3
@2P
n
with V (G) = {w
i
: 1 i 3}{u
i
: 1 i n}{v
i
: 1 i n}
and the vertices w
2
and w
3
of C
3
are identied with v
1
and u
1
of two paths of length n
respectively. Let E(G) = {w
i
w
i+1
: 1 i 2} {u
i
u
i+1
, v
i
v
i+1
: 1 i n} be the edge set of
G. So, |V (G)| = 2n + 3 and |E(G)| = 2n + 3. Dene f : V (G) {l
0
, l
1
, l
2
, , l
a
} , a N
by f(w
1
) = l
n+4
; f(u
i
) = l
n+3i
, 1 i n + 1; f(v
j
) = l
n+4+2j3s
, 3s 2 j 3s for
s = 1, 2, ...,
n 1
3
and f(v
j
) = l
n+4+2j3s
3s 2 j 3s 1 for s =
n 1
3
+ 1.
Lucas Graceful Labeling for Some Graphs 15
We claim that the edge labels are distinct. Let
E
1
=
n
_
i=1
{f
1
(u
i
u
i+1
} =
n
_
i=1
{|f(u
i
) f(u
i+1
)|}
=
n
_
i=1
{|l
n+3i
l
n+3i1
|} =
n
_
i=1
{|l
n+3i
l
n+2i
|}
=
n
_
i=1
{l
n+1i
} = {l
n
, l
n1
, , l
1
} ,
E
2
= {f
1
(u
1
w
1
), f
1
(w
1
v
1
), f
1
(v
1
u
1
)}
= {|f(u
1
) f(w
1
)| , |f(w
1
f(v
1
)| , |f(v
1
) f(u
1
)|}
= {|l
n+2
l
n+4
| , |l
n+4
l
n+3
| , |l
n+3
l
n+2
|} = {l
n+3
, l
n+2
, l
n+1
} .
For s = 1, 2, ,
n 1
3
, let
E
3
=
n1
3
_
s=1
{f
1
(v
j
v
j+1
) : 3s 2 j 3s 1}
=
n1
3
_
s=1
{|f(v
j
) f(v
j+1
)| : 3s 2 j 3s 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
n3
) f(v
n2
)| , |f(v
n2
) f(v
n1
)|}
= {|l
n+3
l
n+5
| , |l
n+5
l
n+7
|} {|l
n+6
l
n+8
| , |l
n+8
l
n+10
|}
_

_
{|l
2n1
l
2n+1
| , |l
2n+1
l
2n+3
|}
= {l
n+4
, l
n+6
}
_
{l
n+7
, l
n+9
}
_

_
{l
2n
, l
2n+2
} .
We nd the edge labeling between the end vertex of s
th
loop and the starting vertex of
(s + 1)
th
loop and 1 s
n 1
3
. Let
E
4
= {f
1
(v
j
v
j+1
) : j = 3s} = {|f(v
j
) f(v
j+1
)| : j = 3s}
= {|f(v
3
) f(v
4
)| , |f(v
6
) f(v
7
)| , , |f(v
n1
) f(v
n
)|}
= {|l
n+7
l
n+6
| , |l
n+10
l
n+9
| , , |l
2n+3
l
2n+2
|} = {l
5
, l
8
, , l
2n+1
} .
For s =
n 1
3
+ 1, let
E
5
= {f
1
(v
j
v(
j+1
) : j = 3s 2} = {|f(v
j
) f(v
j+1
)| : j = n}
= {|f(v
n
) f(v
n+1
)|} = {|l
n+4+2nn2
l
n+4+2n+2n2
|}
= {|l
2n+2
l
2n+4
|} = {l
2n+3
} .
Now, E =
5

s=1
E
i
= {l
1
, l
2
, ..., l
2n+3
}. So, the edge labels of G are distinct. Therefore, f is
a Lucas graceful labeling. Hence, G = C
3
@2P
n
is a Lucas graceful graph if n 1(mod 3).
16 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
Example 2.19 The graph C
3
@2P
4
admits Lucas graceful labeling shown in Fig.8.
v
1
v
2
v
3
v
4
v
5
l
7
l
9
l
11
l
10
l
12
l
8
l
10
l
9
l
11
l
5
l
6
l
5
l
4
l
3
l
2
u
1
u
2
u
3
u
4
u
5
l
4
l
3
l
2
l
1
w
3
w
2
w
1
l
6
l
8
l
7
Fig.8
Theorem 2.20 The graph C
n
@K
1,2
is a Lucas graceful graph if n 1(mod 3).
Proof Let G = C
n
@K
1,2
with V (G) = {u
i
: 1 i n} {v
1
, v
2
}, E(G) = {u
i
u
i+1
:
1 i n 1}{u
n
u
1
, u
n
v
n
, u
n
v
2
}. So, |V (G)| = n+2 and |E(G)| = n+2. Dene f : V (G)
{l
0
, l
1
, l
2
, ..., l
a
} , a N by f(u
1
) = 0, f(v
1
) = l
n
, f(v
2
) = l
n+3
; f(u
i
) = l
2i3s
, 3s 1 i
3s + 1 for s = 1, 2, ...,
n 4
3
and f(u
i
) = l
2i3s
, 3s 1 i 3s for s =
n 1
3
. We claim that
the edge labels are distinct. Let
E
1
= {f
1
(u
1
u
2
) , f
1
(u
n
v
1
), f
1
(u
n
v
2
), f
1
(u
n
u
1
)}
= {|f(u
1
) f(u
2
)| , |f(u
n
) f(v
1
)| , |f(u
n
) f(v
2
)| , |f(u
n
) f(v
1
)|}
= {|l
0
l
1
| , |l
n+1
l
n
| , |l
n+1
l
n+3
| , |l
n+1
l
0
|}
= {l
1
, l
n1
, l
n+2
, l
n+1
} ,
E
2
=
n4
3
_
s=1
{f
1
(u
i
u
i+1
) : 3s 1 i 3s}
=
n4
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
n5
) f(u
n4
)| , |f(u
n4
) f(u
n3
)|}
= {|l
1
l
3
| , |l
3
l
5
|}
_
{|l
4
l
6
| , |l
6
l
8
|}
_

_
{|l
n6
l
n4
| , |l
n5
l
n2
|}
= {l
2
, l
4
}
_
{l
5
, l
7
}
_

_
{l
n5
, l
n3
} = {l
2
, l
4
, l
5
, l
7
, , l
n5
, l
n3
}
We determine the edge labeling between the end vertex of s
th
loop and the starting vertex
Lucas Graceful Labeling for Some Graphs 17
of (s + 1)
th
loop and 1 s
n 4
3
. Let
E
3
= {f
1
(u
i
u
i+1
) : i = 3s + 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
} .
For s =
n1
3
, let
E
4
= {f
1
(u
i
u
i+1
) : 3s 1 i 3s}
= {|f(u
i
) f(u
i+1
)| : 3s 1 i 3s}
= {|f(u
n2
) f(u
n1
)| , |f(u
n1
) f(u
n
)|}
= {|l
2n4n+1
l
2n2n+1
| , |l
2n2n+1
l
2nn+1
|}
= {|l
n3
l
n1
| , |l
n1
l
n+1
|} = {l
n2
, l
n
}
Now, E =
4

i=1
E
i
= {l
1
, l
2
, ..., l
n+2
}. So, the edge labels of G are distinct. Therefore, f is a
Lucas graceful labeling. Hence, G = C
n
@K
1,2
is a Lucas graceful graph.
Example 2.21 The graph C
10
@K
1,2
admits Lucas graceful labeling shown in Fig.9.
l
0
l
1
l
3
l
5
l
4
l
6
l
8
l
7
l
9
l
11
l
11
l
1
l
2
l
4
l
3
l
5
l
7
l
6
l
8
l
10
l
9
l
10
l
12
l
13
Fig.9
3. Strong Lucas Graceful Graphs
In this section, we prove that the graphs K
1,n
and F
n
admit strong Lucas graceful labeling.
Denition 3.1 Let G be a (p, q) graph. An injective function f : V (G) {l
0
, l
1
, l
2
, , l
q
}
is said to be strong Lucas graceful labeling if an induced edge labeling f
1
(uv) = |f(u) f(v)| is
a bijection on to the set {l
1
, l
2
, ..., l
q
} with the assumption of l
0
= 0, l
1
= 1, l
2
= 3, l
3
= 4, l
4
=
18 M.A.Perumal, S.Navaneethakrishnan and A.Nagarajan
7, l
5
= 11, ,. Then G is called strong Lucas graceful graph if it admits strong Lucas graceful
labeling.
Theorem 3.2 The graph K
1,n
is a strong Lucas graceful graph.
Proof Let G = K
1,n
and V = V
1
V
2
be the bipartition of K
1,n
with V
1
= {u
1
} and
V
2
= {u
1
, u
2
, ..., u
n
}. Then, |V (G)| = n+1 and |E(G)| = n. Dene f : V (G) {l
0
, l
1
, l
2
, ..., l
n
}
by f(u
0
) = l
0
, f(u
1
) = l
1
, 1 i n. We claim that the edge labels are distinct. Notice that
E = {f
1
(u
0
u
1
) : 1 i n} = {f(u
0
) f(u
1
) : 1 i n}
= {|f(u
0
) f(u
1
)| , |f(u
0
) f(u
2
)| , ..., |f(u
0
) f(u
n
)|}
= {|l
0
l
1
| , |l
0
l
2
| , ..., |l
0
l
n
|} = {l
1
, l
2
, ..., l
n
}
So, the edges of G receive the distinct labels. Therefore, f is a strong Lucas graceful labeling.
Hence, K
1
, n the path is a strong Lucas graceful graph.
Example 3.3 The graph K
1,9
admits strong Lucas graceful labeling shown in Fig.10.
l
0
l
1
l
2
l
3
l
4
l
5
l
6
l
7
l
8
l
9
l
1
l
2
l
3
l
4 l
5 l
6
l
7
l
8
l
9
Fig.10
Denition 3.4([2]) Let u
1
, u
2
, ..., u
n
, u
n+1
be the vertices of a path and u
0
be a vertex which
is attached with u
1
, u
2
, ..., u
n
, u
n+1
. Then the resulting graph is called Fan and is denoted by
F
n
= P
n
+ K
1
.
Theorem 3.5 The graph F
n
= P
n
+ K
1
is a Lucas graceful graph.
Proof Let G = F
n
and u
1
, u
2
, ..., u
n
, u
n+1
be the vertices of a path P
n
with the central
vertex u
0
joined with u
1
, u
2
, ..., u
n
, u
n+1
. Clearly, |V (G)| = n + 2 and |E(G)| = 2n + 1. Dene
f : V (G) {l
0
, l
1
, l
2
, ..., l
2n+1
} by f(u
0
) = l
0
and f(u
i
) = l
2i1
, 1 i n + 1. We claim that
the edge labels are distinct.
Calculation shows that
E
1
= {f
1
(u
i
u
i+1
) : 1 i n} = {|f
(
u
i
) f(u
i+1
)| : 1 i n}
= {|f(u
1
) f(u
2
)|, |f(u
2
) f(u
3
)|, ..., |f(u
n
) f(u
n+1
)|}
= {|l
1
l
3
|, |l
3
l
5
|, ..., |l
2n1
l
2n+1
|} = {l
2
, l
4
, ..., l
2n
},
Lucas Graceful Labeling for Some Graphs 19
E
2
= {f
1
(u
0
u
i
) : 1 i n + 1} = {|f(u
0
) f(u
i
)| : 1 i n + 1}
= {|f(u
0
) f(u
1
)|, |f(u
0
) f(u
2
)|, ..., |f(u
0
) f(u
n+1
)|}
= {|l
0
l
1
|, |l
0
l
3
|, ..., |l
0
l
2n+1
|} = {l
1
, l
3
, ..., l
2n+1
}.
Whence, E = E
1
E
2
= {l
1
, l
2
, ..., l
2n
, l
2n+1
}. Thus the edges of F
n
receive the distinct labels.
Therefore, f is a Lucas graceful labeling. Consequently, F
n
= P
n
+ K
1
is a Lucas graceful
graph.
Example 3.6 The graph F
7
= P
7
+ K
1
admits Lucas graceful graph shown in Fig.11.
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
15
l
0
l
2
l
4
l
6
l
8
l
10
l
12
l
14
l
1
l
3
l
5
l
7
l
9
l
11
l
13
l
15
Fig.11
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 Combina-
torics, 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 of Madurai Ka-
maraj University, October 2006.