Super Fibonacci Graceful Labeling for Generalised

(a,m) - Shell Graph and Mereged with Some Graphs

D.Senthil Kumar1 , M.Sugasini2 and S.P.Lavanya3
1,2,3
Department of Mathematics,
1,2,3
Sri Manakula Vinayagar Engineering College,Puducherry, India.
zenthil29@gmail.com

Abstract

A graph G with p vertices and q edges has Super Fibonacci graceful labeling if there exists
an injective map f : V (G) → {F0 , F1 , F2 , . . . Fq } where Fk is the k th Fibonacci number
of the Fibonacci series such that its induced map f + : E(G) → {F1 , F2 , F3 , . . . Fq } defined
by f + (xy) =|f (x) − f (y)| ∀ xy ∈ G, is a bijective map. In this paper, we investigate the
existence of super Fibonacci graceful labeling for the various types of (a, m) - shell graph and
(a, m) - shell graph merged with some graphs.

Key Words: Graceful graph, Fibonacci graceful graph, Super Fibonacci graceful graph, Shell
graph, (a, m) - shell graphs.
2000 AMS Subject Classification: 05C78

1 Introduction
The notions of Fibonacci graceful labeling and super Fibonacci graceful labeling were introduced
by Kathiraesan and Amutha [1] and they proved [2] that Path , caterpillar and bi-star are Fibonacci
graceful. Also they proved every fan graph is super Fibonacci graceful. Jeba Jesintha and Ezhi-
larasi Hilda [3] obtaine the graceful labeling for Shell- Butterfly graph. Meena, Renugha and
Sivasakthi [4] found cordial Labeling for different types of shell graph, shell graph merging with
path, shell graph merging with star, multiple shell graph. These results on super Fibonacci graceful
labeling and other results are mentioned in Gallian survey [5]. Here we use simple, finite, connected
and undirected graph. For graph theoretic terminology we refer to Chartrand and Lesniak [6]. La-

1
beled graphs serve as useful models for a broad range of applications such as Coding theory, X -
ray, Crystallography, Radar, Astronomy, Circuit design and Communication network addressing.

1.1 Basic Definitions:

Definition 1.1. [5] A (p, q) graph G = (V, E) has graceful labeling if there exists an injection map
f : V (G) → {0, 1, 2, . . . , q} such that its induced map f + : E(G) → {1, 2, 3, . . . , q} defined by
f + (uv) = |f (u) − f (v)| for all edge uv in G, is an injective map. Then the graph G is called
graceful.

Definition 1.2. [1] A (p, q) graph G = (V, E) has Fibonacci graceful labeling if there exists an
injective map f : V (G) → {0, 1, 2, . . . , Fq } where Fk is the k th Fibonacci number in the Fi-
bonacci series such that its induced map f + : E(G) → {F1 , F2 , . . . , Fq } defined by f + (xy) =
|f (x) − f (y)| for every edge xy in G, is a bijective.

Definition 1.3. [2] A (p, q) graph G = (V, E) has Super Fibonacci graceful labeling if there exists
an injective map f : V (G) → {F0 , F1 , F2 , . . . , Fq } where Fk is the k th Fibonacci number in
Fibonacci series such that its induced map f + : E(G) → {F1 , F2 , . . . , Fq } defined by f + (xy) =
|f (x) − f (y)| for every edge xy in G, is a bijective.

Definition 1.4. [3] A shell Sn,n−3 of width n is a graph obtained by taking (n − 3) concurrent
chords in a cycle Cn on n vertices. The vertex at which all the chords are concurrent is called
apex. The two vertices adjacent to the apex have degree 2, apex has degree (n − 1) and all the
other vertices have degree 3.

Definition 1.5. Let a > 2 and m > 2 be integer and n = am + (a + 2). An (a, m) shell is a
cycle Cn with vertices v1 , v2 , . . . , vn together with m concurrent chords (edges) at v1 (Apex) and
other ends of chords are adjacent to the vertex vai+2 , (where i = 1, 2, 3, . . . , m.) Here the degree
of v1 is (m + 2), the degree of vai+2 (where i = 1, 2, . . . , m) is 3. All the remaining vertices are
of degree 2. An (a, m) shell graphs is denote as SHa,m .

Definition 1.6. [5] The join G1 + G2 of two graphs G1 and G2 with disjoint vertex sets V1 and V2
∪
and edge sets X1 and X2 is the graph union G1 G2 together with all edges joining each vertex
of V1 to every vertex of V2 . A Fan graph Fn is K1 + Pn .

Definition 1.7. [5] Spider graph Sm,n is defined as a tree with m legs of length n of nm+1 vertices.
S2,2 with two legs of length two of five vertices.

2
2 Main Result
Theorem 2.1. A (a, m)- Shell graph is Super Fibonacci graceful for all integer m > 2 and a is
any positive integer.
{
Proof. Let G be the (a, m) shell graph whose vertex set is {v1 , v2 , . . . , vn } and edge set is {vi vi+1 }i=1
n−1
}
∪
{{v1 vai+2 }m+1
i=1 }. Here m > 2 is any integer and a is any number in the arithmetic progression

x, x + y, x + 2y, x + 3y, . . . where x = 4, y = 3, n = am + (a + 2). and q = n + m.

Construct an injective map f : V (G) → {F0 , F1 , F2 , . . . , Fq } as follows.
Let i varies from 1 to n.
f (v1 ) = F0 ;
f (vi ) = F(a+1)k+(r−1) ; where i = ak + r; k = 0, 1, 2, . . . , (m + 1); r = 2, 5, 8, . . . , (a − 2);
f (vi ) = F(a+1)k+r ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 3, 6, 9, . . . , (a − 1);
f (vi ) = F(a+1)k+(r+1) ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 4, 7, 10, . . . , (a − 3);
f (vak ) = F(a+1)k ; where k = 1, 2, . . . , (m + 1);
f (vak+1 ) = F(a+1)k−1 ; where k = 1, 2, . . . , (m + 1);
The induced map f + from f defined by f + (xy) =|f (x) − f (y)| ∀ xy ∈ G, is an bijective map.
Thus the given graph has Super Fibonacci graceful labeling from the maps f and f + . Hence (a, m)
- shell graph is super Fibonacci graceful for all integer m ≥ 2 and a is any positive integer.

Ft
Theorem 2.2. SHa,m is a super Fibonacci graceful for all integers m, t ≥ 2 and a is any positive
integer.

Proof. Let {u0 , u1 , u2 , . . . , ut } be the vertex set of fan graph (Ft ) and {v1 , v2 , . . . , vn } be the
Ft
vertex set of shell graph SHa,m .Then the graph G = SHa,m is obtained by the apex of the shell
graph v1 is merged with the maximum degree of the fan graph u0 . |V (G)| = am + (a + 2) + t and
{ ∪ ∪ ∪ }
edge set is {vi vi+1 }n−1
i=1 {v 1 v ai+2 } m+1
i=1 {v 1 uj } t
j=1 {uj uj+1 }j=1 for all integers m, t ≥ 2 ,a
t−1

is any number in the arithmetic progression x, x + y, x + 2y, x + 3y, . . . where x = 4, y = 3,

n = am + (a + 2)and q = n + m + 2t − 1 .
Construct an injective map f : V (G) → {F0 , F1 , F2 , . . . , Fq } in the various steps as follows.
Let i varies from 1 to n.
f (v1 ) = F0 ;
f (vi ) = F(a+1)k+(r−1) ; where i = ak + r; k = 0, 1, 2, . . . , (m + 1); r = 2, 5, 8, . . . , (a − 2);
f (vi ) = F(a+1)k+r ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 3, 6, 9, . . . , (a − 1);
f (vi ) = F(a+1)k+(r+1) ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 4, 7, 10, . . . , (a − 3);

3
f (vak ) = F(a+1)k ; where k = 1, 2, . . . , (m + 1);
f (vak+1 ) = F(a+1)k−1 ; where k = 1, 2, . . . , (m + 1);
f (uj ) = F(a+1)m+2j+(a+1) ; where j = 1, 2, 3, . . . , t.
The induced map f + from f defined by f + (xy) =|f (x) − f (y)| ∀ xy ∈ G is an bijective map. Thus
(F )
the given graph has Super Fibonacci graceful labeling from the maps f and f + . Hence SH(a,m)
t
-
shell graph is super Fibonacci graceful for all integer m, t ≥ 2 and a is any positive integer.

S
2c,d
Theorem 2.3. SHa,m is super Fibonacci graceful for all integers m, d ≥ 2,c ≥ 1 and a is any
positive integer.
∪
Proof. Let {u0 , u1 , . . . , u2cd } be the vertex set of S2c,d and edge set is {{u0 ujd+1 }2c−1
j=0 {{ui ui+1 :
2c(d−1)
i is a multiple of d}i=1 }} and {v1 , v2 , . . . , vn } be the vertex set of shell graph SHa,m . Then
S2c,d
the graph G = SHa,m is obtained by the apex of the shell graph v1 is merged with the maximum
∪ ∪
degree spider graph u0 . |V (G)| = (n+2cd) and edge set is {{vi vi+1 }n−1
i=1 {v1 vai+2 }m+1
i=1 {v1 ujd+1 }2c−1
j=0
∪ 2c(d−1)
{ui ui+1 : i is a multiple of d}i=1 } for all integers m, d ≥ 2 ,c ≥ 1 ,a is any number in the
arithmetic progression x, x + y, x + 2y, x + 3y, . . . where x = 4, y = 3 and n = am + (a + 2) and
q = n + m + 2cd
An injective map f : V (G) → {F0 , F1 , . . . , Fq } is constructed as follows:
Let i be in {1, 2, . . . , n}.
f (v1 ) = F0 ;
f (vi ) = F(a+1)k+(r−1) ; where i = ak + r; k = 0, 1, 2, . . . , (m + 1); r = 2, 5, 8, . . . , (a − 2);
f (vi ) = F(a+1)k+r ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 3, 6, 9, . . . , (a − 1);
f (vi ) = F(a+1)k+(r+1) ; where i = ak + r; k = 0, 1, 2, . . . , m; r = 4, 7, 10, . . . , (a − 3);
f (vak ) = F(a+1)k ; where k = 1, 2, . . . , (m + 1);
f (vak+1 ) = F(a+1)k−1 ; where k = 1, 2, . . . , (m + 1);
f (uid+j ) = F( (a+1)n−2 )+2(j−1)+di ; for all i = 0, 2, 4, . . . , (2c − 2) and j = 1, 2, 3, . . . , d.
a

f (uid+j ) = F( (a+1)n−6 )+d(i+1)−2(j−1) ; for all i = 1, 3, 5, . . . , (2c − 1) and j = 1, 2, 3, . . . , d. The

a

induced map f from f defined by f + (xy) = |f (x) − f (y)| ∀ xy ∈ G, is an bijective map. The
+

S S
maps f and f + gives theSHa,m
2c,d 2c,d
graph has super Fibonacci graceful labeling.Hence SHa,m is
super Fibonacci graceful for all integers m, d ≥ 2 ,c ≥ 1 and a is any positive integer.

Example 2.1. A (7, 4)- shell graph is super Fibonacci graceful labeling. It is given in the figure
(1).

4
 Figure 1: Super Fibonacci graceful for (7, 4) - shell graph

3 Acknowledgements
We would like to thank the anonymous referees for carefully reading an earlier version of this
paper, and providing valuable remarks and suggestions that helped to improve its exposition.

References
[1] Kathiresan.K.M.,and Amutha.S,Fibonacci Graceful Graphs,Ars.Combinatorics,97(2010),
41- 50.

[2] Kathiresan.K.M.,and Amutha.S, Fibonacci Graceful Graphs,Ph.D Thesis,Madurai kamaraj

University(October 2006).

[3] Jeba Jesintha.J and Ezhilarasi Hilda.K,Shell - Butterfly graphs are graceful, International
Journal of Pure Applied Mathematics,6(2015),949-956.

[4] Meena.S, Renugha.M and Sivasakthi.M,Cordial Labeling for Different Types of Shell
Graph,International Journal of Scientific Engineering Research,9 (2015),1282-1288.

[5] Joseph A.Gallian,A Dynamic Survey of Graph Labeling, the electronic Journal of combina-
torics,17(2010)DS6, Thirteenth edition, Nov.17, 2011.

[6] Chartrand.G and Lesniak.L,Graphs and Digraphs, Fourth Edition, Chapman and Hall/CRC
(2005).