International J.Math. Combin. Vol.

1 (2011), 59-72

Super Fibonacci Graceful Labeling of

Some Special Class of Graphs
R.Sridevi1 , S.Navaneethakrishnan2 and K.Nagarajan1
1. Department of Mathematics, Sri S.R.N.M.College, Sattur - 626 203, Tamil Nadu, India
2. Department of Mathematics, V.O.C.College, Tuticorin - 628 008, Tamil Nadu, India
E-mail: r.sridevi 2010@yahoo.com, snk.voc@gmail.com, k nagarajan srnmc@yahoo.co.in

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. Certainly,

it is a generalization of Fibonacci sequence. A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in 2006.
Generally, 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 Fibonacci sequence Fi , i 0,
such a graph is called a super Fibonacci graceful graph. In this paper, we show that some
t
special class of graphs namely Fnt , Cnt and Sm,n
are super fibonacci graceful graphs.

Key Words: Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling,

super Smarandache-Fibonacci graceful graph, super Fibonacci graceful graph.

AMS(2010): 05C78
1. Introduction
By a graph, we mean a finite undirected graph without loops or multiple edges. A path of
length n is denoted by Pn+1 . A cycle of length n is denoted by Cn . G+ is a graph obtained
from the graph G by attaching pendant vertex to each vertex of G. Graph labelings, where
the vertices are assigned certain values subject to some conditions, have often motivated by
practical problems. In the last five decades enormous work has been done on this subject [1].
The concept of graceful labeling was first introduced by Rosa [6] in 1967. A function f is
a 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, . . . , q} such that when each edge uv is assigned the label |f (u) f (v)|, the resulting
edge labels are distinct.
The notion of Fibonacci graceful labeling and Super Fibonacci graceful labeling were introduced by Kathiresan and Amutha [5]. We call a function f , a fibonacci 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, . . . , Fq }, where
1 Received

November 1, 2010. Accepted February 25, 2011.

60

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

Fq is the q th fibonacci number of the fibonacci series F1 = 1,F2 = 2,F3 = 3, F4 = 5,. . . , such that
each edge uv is assigned the labels |f (u) f (v)|, the resulting edge labels are F1 , F2 , . . . , . . . Fq .
An injective function f : V (G) {F0 , F1 , . . . , Fq }, where Fq is the q th fibonacci number, is said
to be a super fibonacci graceful labeling if the induced edge labeling |f (u) f (v)| is a bijection
onto the set {F1 , F2 , . . . , Fq }. In the labeling problems the induced labelings must be distinct.
So to introduce fibonacci graceful labelings we assume F1 = 1, F2 = 2, F3 = 3, F4 = 5,. . . , as
the sequence of fibonacci numbers instead of 0, 1, 2, [3].

Generally, 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 ([2]). A (p, q)graph G is a super Smarandache-Fibonacci graceful graph if there is an bijection f : V (G)
{S(0), S(1), S(2), . . . , S(q)} such that the induced edge labeling f (uv) = |f (u) f (v)| is a
bijection onto the set {S(1), S(2), . . . , S(q)}. So a super Fibonacci graceful graph is a special
type of Smarandache-Fibonacci graceful graph by definition.
+
We have constructed some new types of graphs namely Fn K1,m
, Cn Pm , K1,n K1,2 ,
Fn Pm and Cn K1,m and we proved that these graphs are super fibonacci graceful labeling
t
in [7]. In this paper, we prove that Fnt , Cnt and Sm,n
are super fibonacci graceful graphs.

2. Main Results
t
In this section, we show that some special class of graphs namely Fnt , Cnt and Sm,n
are super
fibonacci graceful graphs.

Definition 2.1 Let G be a (p, q) graph. An injective function f : V (G) {F0 , F1 , F2 , , Fq },

where Fq is the q th fibonacci number, is said to be a super fibonacci graceful graphs if the induced
edge labeling f (uv) = |f (u) f (v)| is a bijection onto the set {F1 , F2 , . . . , Fq }.
Definition 2.2 The one point union of t copies of fan Fn is denoted by Fnt .
The following theorem shows that the graph Fnt is a super fibonacci graceful graph.
Theorem 2.3 Fnt is a super fibonacci graceful graph for all n 2.
Proof Let u0 be the center vertex of Fnt and uji , where i = 1, 2, . . . , t, j = 1, 2, . . . , n be
the other vertices of Fnt . Also, |V (G)| = nt + 1 and |E(G)| = 2nt t. Define f : V (Fnt )
{F0 , F1 , . . . , Fq } by f (u0 ) = F0 , f (uj1 ) = F2j1 , 1 j n. For i = 2, 3, . . . , t, f (uji ) =
F2n(i1)+2(j1)(i2) , 1 j n. We claim that all these edge labels are distinct. Let E1 =
{f (u0 uj1 ) : 1 j n}. Then
E1

= {|f (u0 ) f (uj1 )| : 1 j n}

= {|f (u0 ) f (u11 )|, |f (u0 ) f (u21 )|, . . . , |f (u0 ) f (un1

)|, |f (u0 ) f (un1 )|}
1

= {|F0 F1 |, |F0 F3 |, . . . , |F0 F2n3 |, |F0 F2n1 |}

= {F1 , F3 , . . . , F2n3 , F2n1 }.

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

61

Let E2 = {f (uj1 uj+1

1 ) : 1 j n 1}. Then
E2

= {|f (uj1 ) f (uj+1

1 )| : 1 j n 1}

= {|f (u11 ) f (u21 )|, |f (u21 ) f (u31 )|, . . . , |f (un2

) f (un1
)|, |f (un1
) f (un1 )|}
1
1
1
= {|F1 F3 |, |F3 F5 |, . . . , |F2n5 F2n3 |, |F2n3 F2n1 |}
= {F2 , F4 , . . . , F2n4 , F2n2 }.
For i = 2, we know that
E3

= {f (u0 uj2 ) : 1 j n} = {|f (u0 ) f (uj2 )| : 1 j n}

= {|f (u0 ) f (u12 )|, |f (u0 ) f (u22 )|, . . . , |f (u0 ) f (un1

)|, |f (u0 ) f (un2 )|}
2
= {|F0 F2n |, |F0 F2n+2 |, . . . , |F0 F4n4 |, |F0 F4n2 |}
= {F2n , F2n+2 , . . . , F4n4 , F4n2 },
E4

= {f (uj2 uj+1
2 ) : 1 j n 1}

= {|f (uj2 ) f (uj+1

2 )| : 1 j n 1}

= {|f (u12 ) f (u22 )|, |f (u22 ) f (u32 )|, . . . , |f (un2

) f (un1
)|, |f (un1
) f (un2 )|}
2
2
2
= {|F2n F2n+2 |, |F2n+2 F2n+4 |, . . . , |F4n6 F4n4 |, |F4n4 F4n2 |}
= {F2n+1 , F2n+3 , . . . , F4n5 , F4n3 }.
For i = 3, let E5 = {f (u0 uj3 ) : 1 j n}. Then
E5

= {|f (u0 ) f (uj3 )| : 1 j n}

= {|f (u0 ) f (u13 )|, |f (u0 ) f (u23 )|, . . . , |f (u0 ) f (un1

)|, |f (u0 ) f (un3 )|}
3
= {|F0 F4n1 |, |F0 F4n+1 |, . . . , |F0 F6n5 |, |F0 F6n3 |}
= {F4n1 , F4n+1 , . . . , F6n5 , F6n3 }.
Let E6 = {f (uj3 uj+1
3 ) : 1 j n 1}. Then
E6

= {|f (uj3 ) f (uj+1

3 )| : 1 j n 1}

= {|f (u13 ) f (u23 )|, |f (u23 ) f (u33 )|, . . . , |f (un2

) f (un1
)|, |f (un1
) f (un3 )|}
3
3
3
= {|F4n1 F4n+1 |, |F4n+1 F4n+3 |, . . . , |F6n7 F6n5 |, |F6n5 F6n3 |}
= {F4n , F4n+2 , . . . , F6n6 , F6n4 }
,
Now, for i = t 1, let Et1 = {f (u0 ujt1 ) : 1 j n}. Then
Et1

= {|f (u0 ) f (ujt1 )| : 1 j n}

n
= {|f (u0 ) f (u1t1 )|, |f (u0 ) f (u2t1 )|, . . . , |f (u0 ) f (un1
t1 )|, |f (u0 ) f (ut1 )|}

= {|F0 F2nt4nt+3 |, |F0 F2nt4nt+5 |, . . . , |F0 F2nt2nt1 |, |F0 F2nt2nt+1 |}

= {F2nt4nt+3 , F2nt4nt+5 , . . . , F2nt2nt1 , F2nt2nt+1 }.

62

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

Let Et1 = {f (ujt1 uj+1

t1 ) : 1 j n 1}. Then
Et1

=
=

{|f (ujt1 ) f (uj+1

t1 )| : 1 j n 1}

{|f (u1t1 ) f (u2t1 )|, |f (u2t1 ) f (u3t1 )|,

n1
n1
n
. . . , |f (un2
t1 ) f (ut1 )|, |f (ut1 ) f (ut1 )|}

{|F2nt4nt+3 F2nt4nt+5 |, |F2nt4nt+5 F2nt4nt+7 |,

. . . , |F2nt2nt3 F2nt2nt1 |, |F2nt2nt1 F2nt2nt+1 |}

{F2nt4nt+4 , F2nt4nt+6 , . . . , F2nt2nt2 , F2nt2nt }.

F44 :

F22 F23 F24 F25 F26 F27 F28

F22 F24 F26

F28
F1

F21
F20

F21

F19

F19

F18
F17

F17

F16

F1
F2

F0

F3
F5
F7

F15

F15

F14 F12

F10 F8

F3
F4
F5
F6
F7

F14 F13 F12 F11 F10 F9 F8

Fig.1

For i = t, let Et = {f (u0 ujt ) : 1 j n}. Then

Et

=
=

{|f (u0 ) f (ujt )| : 1 j n}

{|f (u0 ) f (u1t )|, |f (u0 ) f (u2t )|, . . . , |f (u0 ) f (un1

)|,
t
|f (u0 ) f (unt )|}

{|F0 F2nt2nt+2 |, |F0 F2nt2nt+4 |, . . . , |F0 F2ntt2 |, |F0 F2ntt |}

{F2nt2nt+2 , F2nt2nt+4 , . . . , F2ntt2 , F2ntt }.

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

63

Let Et = {f (ujt uj+1

) : 1 j n 1}. Then
t
Et

= {|f (ujt ) f (uj+1

)| : 1 j n 1}
t

)|, |f (un1
) f (unt )|}
= {|f (u1t ) f (u2t )|, |f (u2t ) f (u3t )|, . . . , |f (un2
) f (un1
t
t
t
= {|F2nt2nt+2 F2nt2nt+4 |, |F2nt2nt+4 F2nt2nt+6 |,
. . . , |F2ntt4 F2ntt2 |, |F2ntt2 F2ntt |}
= {F2nt2nt+3 , F2nt2nt+5 , . . . , F2ntt3 , F2ntt1 }.
Therefore, E = E1 E2 , . . . , Et1 Et = {F1 , F2 , . . . , F2ntt } Thus, the edge labels are
distinct. Therefore, Fnt admits super fibonacci graceful labeling.

For example the super fibonacci graceful labeling of F44 is shown in Fig.1.
Definition 2.4 The one point union of t cycles of length n is denoted by Cnt .
Theorem 2.5 Cnt is a super fibonacci graceful graph for n 0(mod3).
Proof Let u0 be the one point union of t cycles and u1 , u2 , . . . , ut(n1) be the other vertices
of Cnt . Also, |V (G)| = t(n 1) + 1, |E(G)| = nt. Define f : V (Cnt ) {F0 , F1 , . . . , Fq } by
f (u0 ) = F0 . For i = 1, 2, . . . , t, f (u(n1)(i1)+(j1)+1 ) = Fntn(i1)2(j1) , 1 j 2. For s =
1, 2, , n3
3 , i = 1, 2, . . . , t, f (u(n1)(i1)+j ) = Fnt1n(i1)2(js2)+(s1) , 3s j 3s + 2.
Next, we claim that the edge labels are distinct.
We find the edge labeling between the vertex u0 and starting vertex of each copy of
(u(n1)(i1)+1 ). Let E1 = {f (u0 u(n1)(i1)+1 ) : 1 i t}. Then
E1

{|f (u0 ) f (u(n1)(i1)+1 )| : 1 i t}

{|f (u0 ) f (u1 )|, |f (u0 ) f (un )|, . . . , |f (u0 ) f (unt2nt+3 )|,
|f (u0 ) f (untnt+2 )|}

{|F0 Fnt |, |F0 Fntn |, . . . , |F0 F2n |, |F0 Fn |}

{Fnt , Fntn , . . . , F2n , Fn }

Now we determine the edge labelings between the vertex u(n1)(i1)+1 and the vertex
u(n1)(i1)+2 of each copy. Let E2 = {f (u(n1)(i1)+1 u(n1)(i1)+2 ) : 1 i t}. Then
E2

{|f (u(n1)(i1)+1 ) f (u(n1)(i1)+2 )| : 1 i t}

{|f (u1 ) f (u2 )|, |f (un ) f (un+1 )|, . . . ,

|f (unt2nt+3 ) f (unt2nt+4 )|, |f (untnt+2 ) f (untnt+3 )|}

{|Fnt Fnt2 |, |Fntn Fntn2 |, . . . , |F2n F2n2 |, |Fn Fn2 |}

{Fnt1 , Fntn1 , . . . , F2n1 , Fn1 }

We calculate the edge labeling between the vertex u(n1)(i1)+2 and starting vertex u(n1)(i1)+3

64

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

of the first loop. Let E3 = {f (u(n1)(i1)+2 u(n1)(i1)+3 ) : 1 i t}. Then

= {|f (u(n1)(i1)+2 ) f (u(n1)(i1)+3 )| : 1 i t}

E3

= {|f (u2 ) f (u3 )|, |f (un+1 ) f (un+2 )|, |f (u2n ) f (u2n+1 )|, . . . ,
|f (unt2nt+4 ) f (unt2nt+5 )|, |f (untnt+3 ) f (untnt+4 )|}
= {|Fnt2 Fnt1 |, |Fntn2 Fntn1 |, |Fnt2n2 Fnt2n1 |,
. . . , |F2n2 F2n1 |, |Fn2 Fn1 |}
= {Fnt3 , Fntn3 , Fnt2n3 , . . . , F2n3 , Fn3 }.

Now, for s = 1, let E4 =

t
S

i=1

E4

{f (u(n1)(i1)+j u(n1)(i1)+j+1 ) : 3 j 4}. Then

ti=1 {|f (u(n1)(i1)+j ) f (u(n1)(i1)+j+1 )| : 3 j 4}

{|f (u3 ) f (u4 )|, |f (u4 ) f (u5 )|}

{|f (un+2 ) f (un+3 )|, |f (un+3 ) f (un+4 )|}, . . . ,
{|f (unt2nt+5 ) f (unt2nt+6 )|, |f (unt2nt+6 ) f (unt2nt+7 )|}
{|f (untnt+4 ) f (untnt+5 )|, |f (untnt+5 ) f (untnt+6 )|}

{|Fnt1 Fnt3 |, |Fnt3 Fnt5 |}

{|Fntn1 Fntn3 |, |Fntn3 Fntn5 |}
, . . . , {|F2n1 F2n3 |, |F2n3 F2n5 |}
{|Fn1 Fn3 |, |Fn3 Fn5 |}

{Fnt2 , Fnt4 } {Fntn2 , Fntn4 }, . . . ,

{F2n2 , F2n4 } {Fn2 , Fn4 }

For the edge labeling between the end vertex (u(n1)(i1)+5 ) of the first loop and starting
vertex (u(n1)(i1)+6 ) of the second loop, calculation shows that

E41

= {|f (u(n1)(i1)+5 ) f (u(n1)(i1)+6 )| : 1 i t}

= {|f (u5 ) f (u6 )|, |f (un+4 ) f (un+5 )|, . . . ,
|f (unt2nt+7 ) f (unt2nt+8 )|, |f (untnt+6 ) f (untnt+7 )|}
= {|Fnt5 Fnt4 |, |Fntn5 Fntn4 |, . . . , |F2n5 F2n4 |, |Fn5 Fn4 |}
= {Fnt6 , Fntn6 , . . . , F2n6 , Fn6 }

For s = 2, let E5 = ti=1 {f (u(n1)(i1)+j u(n1)(i1)+j+1 ) : 6 j 7}. Then

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

E5

65

= ti=1 {|f (u(n1)(i1)+j ) f (u(n1)(i1)+j+1 )| : 6 j 7}

= {|f (u6 ) f (u7 )|, |f (u7 ) f (u8 )|}
{|f (un+5 ) f (un+6 )|, |f (un+6 ) f (un+7 )|}, . . . ,
|f (unt2nt+8 ) f (unt2nt+9 )|, |f (unt2nt+9 ) f (unt2nt+10 )|}
{|f (untnt+7 ) f (untnt+8 )|, |f (untnt+8 ) f (untnt+9 )|}
= {|Fnt4 Fnt6 |, |Fnt6 Fnt8 |}
{|Fntn4 Fntn6 |, |Fntn6 Fntn8 |}
, . . . , {|F2n4 F2n6 |, |F2n6 F2n8 |}
{|Fn4 Fn6 |, |Fn6 Fn8 |}
= {Fnt5 , Fnt7 } {Fntn5 , Fntn7 }, . . . ,
{F2n5 , F2n7 } {Fn5 , Fn7 }

Similarly, for finding the edge labeling between the end vertex (u(n1)(i1)+8 ) of the second
loop and starting vertex (u(n1)(i1)+9 ) of the third loop, calculation shows that
E51

= {|f (u(n1)(i1)+8 ) f (u(n1)(i1)+9 )| : 1 i t}

= {|f (u8 ) f (u9 )|, |f (un+7 ) f (un+8 )|, . . . ,
|f (unt2nt+10 ) f (unt2nt+11 )|, |f (untnt+9 ) f (untnt+10 )|}
= {|Fnt8 Fnt7 |, |Fntn8 Fntn7 |, . . . , |F2n8 F2n7 |,
|Fn8 Fn7 |}
= {Fnt9 , Fntn9 , . . . , F2n9 , Fn9 },
,

For s =
Then

n3
1, let E n3 1 = ti=1 {f (u(n1)(i1)+j u(n1)(i1)+j+1 ) : n 6 j n 5}.
3
3

E n3 1
3

= ti=1 {|f (u(n1)(i1)+j ) f (u(n1)(i1)+j+1 )| : n 6 j n 5}

= {|f (un6 ) f (un5 )|, |f (un5 ) f (un4 )|}
{|f (u2n7 ) f (u2n6 )|, |f (u2n6 ) f (u2n5 )|}, . . . ,
{|f (untnt4 ) f (untnt3 )|, |f (untnt3 ) f (untnt2 )|}
{|f (untt5 ) f (untt4 )|, |f (untt4 ) f (untt3 )|}
= {|Fntn+8 Fntn+6 |, |Fntn+6 Fntn+4 |} {|Fnt2n+8 Fnt2n+6 |,
|Fnt2n+6 Fnt2n+4 |}, . . . , {|Fn+8 Fn+6 |, |Fn+6 Fn+4 |}
{|F8 F6 |, |F6 F4 |}
= {Fntn+7 , Fntn+5 } {Fnt2n+7 , Fnt2n+5 }, . . . , {Fn+7 , Fn+5 }
{F7 , F5 }

66

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

th
We calculate the edge labeling between the end vertex (u(n1)(i1)+n4 ) of the ( n3
3 1)
n3 rd
loop and starting vertex (u(n1)(i1)+n3 ) of the ( 3 ) loop as follows.

E 1n3 1

{|f (u(n1)(i1)+n4 ) f (u(n1)(i1)+n3 )| : 1 i t}

{|f (un4 ) f (un3 )|, |f (u2n5 ) f (u2n4 )|, . . . ,

|f (untnt+2 ) f (untnt1 )|, |f (untt3 ) f (untt2 )|}

=

{|Fntn+6 Fntn+5 |, |Fnt2n+4 Fnt2n+5 |, . . . ,

|Fn+4 Fn+5 |, |F4 F5 |}

=
For s =
Then

{Fntn+4 , Fnt2n+3 , . . . , Fn+3 , F3 }

t
S
n3
, let E n3 =
{f (u(n1)(i1)+j u(n1)(i1)+j+1 ) : n 3 j n 2}.
3
3
i=1

= ti=1 {|f (u(n1)(i1)+j ) f (u(n1)(i1)+j+1 )| : n 3 j n 2}

E n3
3

= {|f (un3 ) f (un2 )|, |f (un2 ) f (un1 )|}

{|f (u2n4 ) f (u2n3 )|, |f (u2n3 ) f (u2n2 )|}, . . . ,
|f (untnt1 ) f (untnt )|, |f (untnt ) f (untnt+1 )|}
{|f (untt2 ) f (untt1 )|, |f (untt1 ) f (untt )|}
= {|Fntn+5 Fntn+3 |, |Fntn+3 Fntn+1 |}
{|Fnt2n+5 Fnt2n+3 |, |Fnt2n+3 Fnt2n+1 |}, . . . ,
{|Fn+5 Fn+3 |, |Fn+3 Fn+1 |} {|F5 F3 |, |F3 F1 |}
= {Fntn+4 , Fntn+2 } {Fnt2n+4 , Fnt2n+2 }, . . . ,
{Fn+4 , Fn+2 } {F4 , F2 }
rd
Calculation shows the edge labeling between the end vertex (u(n1)(i1)+n1 ) of the ( n3
3 )
loop and the vertex u0 are

{|f (u(n1)(i1)+n1 ) f (u0 )| : 1 i t}

{|f (un1 ) f (u0 )|, |f (u2n2 ) f (u0 )|, . . . ,

|f (untnt+1 ) f (u0 )|, |f (untt ) f (u0 )|}

{|Fntn+1 F0 |, |Fnt2n+1 F0 |, . . . , |Fn+1 F0 |, |F1 F0 |}

{Fntn+1 , Fnt2n+1 , . . . , Fn+1 , F1 }.

Therefore,
E

=
=

(E1 E2 , . . . , E n3 ) (E41 E51 , . . . , E 1n3 1 ) E

3

{F1 , F2 , . . . , Fnt }

Thus, the edge labels are distinct. Therefore, Cnt admits a super fibonacci graceful labeling. 

67

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

C92 :

F6 F7 F8

F6

F7 F8

F10 F11 F12 F13 F14 F12 F13

F9
F10

F9

F14

F5

F0
F1 F18

F4 F3 F5

F4

F3

F2 F1

F18 F17 F16 F15 F17 F16 F15

Fig.2
For example the super fibonacci graceful labeling of C92 is shown in Fig.2.

Definition 2.6([4]) Let Sm,n stand for a star with n spokes in which each spoke is a path of
length m.
t
Definition 2.7 The one point union of t copies of Sm,n is denoted by Sm,n
.
t
Next theorem shows that the graph Sm,n
is a super Fibonacci graceful graph.
t
Theorem 2.8 Sm,n
is a super fibonacci graceful graph for all m, n, when n 1(mod3).

Proof Let v0 be the center of the star and vji , i = 1, 2, . . . , mt, j = 1, 2, . . . , n be the
t
t
other vertices of Sm,n
. Also, |V (G)| = mnt + 1 and |E(G)| = mnt. Define f : V (Sm,n
)
i
{F0 , F1 , . . . , Fq } by f (v0 ) = F0 . For i = 1, 2, . . . , mt, f (vj ) = Fmntn(i1)2(j1) , 1 j 2.
For i = 1, 2, . . . , mt, F (vji ) = Fmnt(2jn1)n(i1) , n 1 j n. For s = 1, 2, . . . , n4
3 ,
i = 1, 2, . . . , mt
f (vji ) = Fmnt1n(i1)2(js2)+(s1) , 3s j 3s + 2. We claim that all these edge labels are
distinct. Let E1 = {f (v0 v1i ) : 1 i mt}. Calculation shows that
E1

=
=

{|f (v0 ) f (v1i )| : 1 i mt}

{|f (v0 ) f (v11 )|, |f (v0 ) f (v12 )|, . . . , |f (v0 ) f (v1mt1 )|,

|f (v0 ) f (v1mt )|}

=

{|F0 Fmnt |, |F0 Fmntn |, . . . , |F0 F2n |, |F0 Fn |}

{Fmnt , Fmntn , . . . , F2n , Fn }.

Let E2 = {f (v1i v2i ) : 1 i mt}. Then

E2

=
=

{|f (v1i ) f (v2i )| : 1 i mt}

{|f (v11 ) f (v21 )|, |f (v12 ) f (v22 )|, . . . , |f (v1mt1 ) f (v2mt1 )|,

|f (v1mt ) f (v2mt )|}

=

{|Fmnt Fmnt2 |, |Fmntn Fmntn2 |, . . . , |F2n F2n2 |, |Fn Fn2 |}

{Fmnt1 , Fmntn1 , . . . , F2n1 , Fn1 }

68

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

For the edge labeling between the vertex v2i and starting vertex v3i of the first loop, let
E3 = {f (v2i v3i ) : 1 i mt}. Calculation shows that
E3

= {|f (v2i ) f (v3i )| : 1 i mt}

= {|f (v21 ) f (v31 )|, |f (v22 ) f (v32 )|, . . . , |f (v2mt1 ) f (v3mt1 )|,
|f (v2mt ) f (v3mt )|}

= {|Fmnt2 Fmnt1 |, |Fmntn2 Fmntn1 |, . . . , |F2n2 F2n1 |,

|Fn2 Fn1 |}
= {Fmnt3 , Fmntn3 , . . . , F2n3 , Fn3 }.
i i
For s = 1, let E4 = mt
i=1 {f (vj vj+1 ) : 3 j 4}. Then

E4

i
i
= mt
i=1 {|f (vj ) f (vj+1 )| : 3 j 4}

= {|f (v31 ) f (v41 )|, |f (v41 ) f (v51 )|} {|f (v32 ) f (v42 )|, |f (v42 ) f (v52 )|}
, . . . , {|f (v3mt1 ) f (v4mt1 )|, |f (v4mt1 ) f (v5mt1 )|}

{|f (v3mt ) f (v4mt )|, |f (v4mt ) f (v5mt )|}

= {|Fmnt1 Fmnt3 |, |Fmnt3 Fmnt5 |}

{|Fmntn1 Fmntn3 |, |Fmntn3 Fmntn5 |}
, . . . , {|F2n1 F2n3 |, |F2n3 F2n5 |}
{|Fn1 Fn3 |, |Fn3 Fn5 |}
= {Fmnt2 , Fmnt4 } {Fmntn2 , Fmntn4 }, . . . , {F2n2 , F2n4 }
{Fn2 , Fn4 }.
We find the edge labeling between the vertex v5i of the first loop and starting vertex v6i of
the second loop. Let E41 = {f (v5i v6i ) : 1 i mt}. Then
E41

=
=

{|f (v5i ) f (v6i )| : 1 i mt}

{|f (v51 ) f (v61 )|, |f (v52 ) f (v62 )|, . . . , |f (v5mt1 ) f (v6mt1 )|,

|f (v5mt ) f (v6mt )|}

=

{|Fmnt5 Fmnt4 |, |Fmntn5 Fmntn4 |, . . . , |F2n5 F2n4 |,

|Fn5 Fn4 |}

{Fmnt6 , Fmntn6 , . . . , F2n6 , Fn6 }.

i i
For s = 2, let E5 = mt
i=1 {f (vj vj+1 ) : 6 j 7}. Then

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

E5

=
=

69

i
i
mt
i=1 {|f (vj ) f (vj+1 )| : 6 j 7}

{|f (v61 ) f (v71 )|, |f (v71 ) f (v81 )|} {|f (v62 ) f (v72 )|, |f (v72 ) f (v82 )|}

, . . . , . . . , {|f (v6mt1 ) f (v7mt1 )|, |f (v7mt1 ) f (v8mt1 )|}

{|f (v6mt ) f (v7mt )|, |f (v7mt ) f (v8mt )|}

{|Fmnt4 Fmnt6 |, |Fmnt6 Fmnt8 |} {|Fmntn4 Fmntn6 |,

|Fmntn6 Fmntn8 |}, . . . , {|F2n4 F2n6 |, |F2n6 F2n8 |}
{|Fn4 Fn6 |, |Fn6 Fn8 |}

{Fmnt5 , Fmnt7 } {Fmntn5 , Fmntn7 }, . . . , {F2n5 , F2n7 }

{Fn5 , Fn7 }.

Let E51 = {f (v8i v9i ) : 1 i mt}. Calculation shows that the edge labeling between the
vertex v8i of the second loop and starting vertex v9i of the third loop are
E51

=
=

{|f (v8i ) f (v9i )| : 1 i mt}

{|f (v81 ) f (v91 )|, |f (v82 ) f (v92 )|, . . . , |f (v8mt1 ) f (v9mt1 )|,
|f (v8mt ) f (v9mt )|}

{|Fmnt8 Fmnt7 |, |Fmntn8 Fmntn7 |, . . . ,

|F2n8 F2n7 |, |Fn8 Fn7 |}

=
For s =

{Fmnt9 , Fmntn9 , . . . , F2n9 , Fn9 }.

n4
i i
1, let E n4 1 = mt
i=1 {f (vj vj+1 ) : n 7 j n 6}. Then
3
3

E n4 1
3

=
=

i
i
mt
i=1 {|f (vj ) f (vj+1 )| : n 7 j n 6}
1
1
1
1
{|f (vn7
) f (vn6
)|, |f (vn6
) f (vn5
)|}

2
2
2
2
{|f (vn7
) f (vn6
)|, |f (vn6
) f (vn5
)|}

mt1
mt1
mt1
mt1
, . . . , {|f (vn7
) f (vn6
)|, |f (vn6
) f (vn5
)|}
mt
mt
mt
mt
{|f (vn7
) f (vn6
)|, |f (vn6
) f (vn5
)|}

{|Fmntn+9 Fmntn+7 |, |Fmntn+7 Fmntn+5 |}

{|Fmnt2n+9 Fmnt2n+7 |, |Fmnt2n+7 Fmnt2n+5 |}
, . . . , {|Fn+9 Fn+7 |, |Fn+7 Fn+5 |}
{|F9 F7 |, |F7 F5 |}

{Fmntn+8 , Fmntn+6 } {Fmnt2n+8 , Fmnt2n+6 }, . . . ,

{Fn+8 , Fn+6 } {F8 , F6 }.

i
th
Similarly, for the edge labeling between the end vertex vn5
of the ( n4
loop and
3 1)
n4 rd
i
1
i
i
starting vertex vn4 of the ( 3 ) loop, let E n4 1 = {f (vn5 vn4 ) : 1 i mt}. Calcula3

70

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

tion shows that

E 1n4 1

i
i
{|f (vn5
) f (vn4
)| : 1 i mt}

1
1
2
2
{|f (vn5
) f (vn4
)|, |f (vn5
) f (vn4
)|, . . . ,

mt1
mt1
mt
mt
|f (vn5
) f (vn4
)|, |f (vn5
) f (vn4
)|}

{|Fmntn+5 Fmntn+6 |, |Fmnt2n+5 Fmnt2n+6 |, . . . ,

|Fn+5 Fn+6 |, |F5 F6 |}

{Fmntn+4 , Fmnt2n+4 , . . . , Fn+4 , F4 }.

mt
S i i
n4
, let E n4 =
{f (vj vj+1 ) : n 4 j n 3}. Then
3
3
i=1

Now for s =

E n4
3

i
i
= mt
i=1 {|f (vj ) f (vj+1 )| : n 4 j n 3}
1
1
1
1
= {|f (vn4
) f (vn3
)|, |f (vn3
) f (vn2
)|}

2
2
2
2
{|f (vn4
) f (vn3
)|, |f (vn3
) f (vn2
)|}

mt1
mt1
mt1
mt1
, . . . , {|f (vn4
) f (vn3
)|, |f (vn4
) f (vn3
)|}
mt
mt
mt
mt
{|f (vn4
) f (vn3
)|, |f (vn3
) f (vn2
)|}

= {|Fmntn+6 Fmntn+4 |, |Fmntn+4 Fmntn+2 |}

{|Fmnt2n+6 Fmnt2n+4 |, |Fmnt2n+4 Fmnt2n+2 |}
, . . . , {|Fn+6 Fn+4 |, |Fn+4 Fn+2 |}
{|F6 F4 |, |F4 F2 |}
= {Fmntn+5 , Fmntn+3 } {Fmnt2n+5 , Fmnt2n+3 }, . . . ,
{Fn+5 , Fn+3 } {F5 , F3 }.
i
rd
We find the edge labeling between the end vertex vn2
of the ( n4
loop and the vertex
3 )

i
i
Let E1 = {f (vn2 vn1 ) : 1 i mt}. Then

i
vn1
.

E1

=
=

i
i
{|f (vn2
) f (vn1
)| : 1 i mt}

mt1
mt1
1
1
2
2
{|f (vn2
) f (vn1
)|, |f (vn2
) f (vn1
)|, . . . , |f (vn2
) f (vn1
)|,

mt
mt
|f (vn2
) f (vn1
)|}

{|Fmntn+2 Fmntn+3 |, |Fmnt2n+2 Fmnt2n+3 |, . . . ,

|Fn+2 Fn+3 |, |F2 F3 |}

{Fmntn+1 , Fmnt2n+1 , . . . , Fn+1 , F1 }.

i
Let E2 = {f (vn1
vni ) : 1 i mt}. Then

E2

=
=

i
{|f (vn1
) f (vni )| : 1 i mt}

2
1
{|f (vn1
) f (vn1 )|, |f (vn1
) f (vn2 )|, . . . ,

mt1
mt
|f (vn1
) f (vnmt1 )|, |f (vn1
) f (vnmt )|}

{|Fmntn+3 Fmntn+1 |, |Fmnt2n+3 Fmnt2n+1 |, . . . ,

|Fn+3 Fn+1 |, |F3 F1 |}

{Fmntn+2 , Fmnt2n+2 , . . . , Fn+2 , F2 }.

Super Fibonacci Graceful Labeling of Some Special Class of Graphs

71

Therefore,
E

=
=

(E1 E2 , . . . , E n4 ) (E41 E51 , . . . , E 1n4 1 ) E1 E2

3

{F1 , F2 , . . . , Fmnt }

t
Thus, Sm,n
admits a super fibonacci graceful labeling.

2
For example the super fibonacci graceful labeling of S3,7
is shown in Fig.3.

F42 F41 F40 F39 F41 F40 F39 F38 F37 F36 F38 F37 F36
F42

F35 F34 F33 F32 F34 F33 F32 F31 F30 F29 F31 F30 F29

F35
F0

F28

F7

F14 F21

F7
F6
F5
F4

F14
F13
F12
F11
F13
F12
F11
F10

F6
F5
F4
F3
F2
F1
F3
F2
F1

F9
F8
F10
F9
F8

F28 F27 F26 F25

F27 F26 F25 F24 F23 F22 F24 F23 F22

F21
F20
F19
F18
F20
F19
F18
F17
F16
F15
F17
F16
F15

Fig.3

Theorem 2.9 The complete graph Kn is a super fibonacci graceful graph if n 3.

Proof Let {v0 , v1 , . . . , vn1 } be the vertex set of Kn . Then vi (0 i n 1) is adjacent
to all other vertices of Kn . Let v0 and v1 be labeled as F0 and Fq respectively. Then v2 must
be given Fq1 or Fq2 so that the edge v1 v2 will receive a fibonacci number Fq2 or Fq1 .
Therefore, the edges will receive the distinct labeling. Suppose not, Let v0 and v1 be labeled as
F1 and Fq or F0 and Fq2 respectively. Then v2 must be given Fq1 or Fq2 so that the edges
v0 v2 and v1 v2 will receive the same edge label Fq2 , which is a contradiction by our definition.
Hence, Kn is super fibonacci graceful graph if n 3.


72

R.Sridevi, S.Navaneethakrishnan and K.Nagarajan

References
[1] G.J.Gallian, A Dynamic survey of graph labeling, The electronic Journal of Combinotorics,
16(2009), #DS6, PP219.
[2] Henry Ibstedt, Surfing on the Ocean of Numbers a Few Smarandache Notions and Similar
Topics, Ethus University Press, Vail 1997.
[3] Ian Anderson, A First Course in Combinatorial Mathematics, Claridon Press-Oxford,
28(1989) 3-13.
[4] K.Kathiresan, Two classes of graceful graphs, Ars Combin., 55(2000) 129-132.
[5] K.M.Kathiresan and S.Amutha, Fibonacci Graceful Graphs, Ph.D.Thesis, Madurai Kamaraj University, October 2006.
[6] A.Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (International
Symposium, Rome), July (1966).
[7] R.Sridevi, S.Navaneethakrishnan and K.Nagarajan, Super Fibonacci graceful graphs, International Journal of Mathematical Combinatorics, Vol.3(2010) 22-40.