See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/290787587

Fibonacci Graceful Labeling of some Star Related Graphs

Article  in  International Journal of Computer Applications · January 2016

DOI: 10.5120/ijca2016908040

CITATION READS

1 882

2 authors, including:

Uma Raj
Sree Saraswathi Thyagaraja College
8 PUBLICATIONS   11 CITATIONS   

SEE PROFILE

All content following this page was uploaded by Uma Raj on 02 March 2016.

The user has requested enhancement of the downloaded file.

 International Journal of Computer Applications (0975 – 8887)
Volume 134 – No.15, January 2016

Fibonacci Graceful Labeling of some Star Related

Graphs
R. Uma D. Amuthavalli
Dept. of Mathematics Research Scholar, Dept. of Mathematics
Sree Saraswathi Thyagaraja College, Sree Saraswathi Thyagaraja college,
(Autonomous), (Autonomous), Pollachi.
Pollachi, India

ABSTRACT Definition 2.4 The Jelly fish graph 𝐽(𝑚, 𝑛) is obtained by

The function 𝑓: 𝑉(𝐺) ⟶ {0,1,2, … , 𝐹𝑞 } (where 𝐹𝑞 is the 𝑞 𝑡ℎ joining a 4-cycle whose vertices are 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 with
vertices 𝑣1 and 𝑣3 defined by an edge and appending 𝑚
Fibonacci number) is said to be Fibonacci graceful if the
pendent edges to 𝑣2 and 𝑛 pendent edges to 𝑣4 .
induced edge labeling 𝑓 ∗ ∶ 𝐸(𝐺) ⟶ {𝐹1 , 𝐹2 , … , 𝐹𝑞 } defined
by 𝑓 ∗ (𝑢𝑣) = 𝑓(𝑢) − 𝑓(𝑣) is bijective. In this paper an Definition 2.5 A Coconut Tree 𝐶𝑇(𝑚 , 𝑛) is the graph
analysis is made on Comb, Subdivision of Bistar 𝐵2,𝑛 𝑊𝑖 , obtained from the path 𝑃𝑚 by appending 𝑛 new pendent
Coconut Tree and Jellyfish graphs under Fibonacci graceful edges at an end vertex of 𝑃𝑚 .
labeling.
3. RESULTS
AMS Classification 3.1 Theorem
05C78 Combs are Fibonacci graceful for 𝑛 > 2.
Keywords Proof:
Comb, Subdivision of Bistar, Jelly fish, Coconut Tree,
Fibonacci graceful labeling and Fibonacci graceful graph. Let 𝐺 = (𝑉, 𝐸, 𝑓) be the comb graph 𝑃𝑛 𝐴𝐾1 . The order of the
comb is 𝑝 = 2𝑛 and the size of the comb is 𝑞 = 2𝑛. Let
𝑉 𝐺 = {𝑢1 , … , 𝑢𝑛 , 𝑣1 , 𝑣2 , … , 𝑣𝑛 } where 𝑢1 , 𝑢2 , … , 𝑢𝑛 are
1. INTRODUCTION the vertices of the path 𝑃𝑛 and and 𝑣1 , 𝑣2 , … , 𝑣𝑛 are the
In graph labeling vertices or edges or both assigned values pendant vertices attaching by the path 𝑃𝑛 . The edge set
subject to the conditions. There are many types of labeling.
𝐸 𝐺 = 𝑒𝑖 , 𝑒𝑖𝑗 where 𝑒𝑖 = (𝑢𝑖 𝑣𝑖 ) and 𝑒𝑖𝑗 = 𝑢𝑖 𝑢𝑗 .
More number of labeling techniques found their starting
point from “graceful labeling” introduced by Rosa Define the function 𝑓: 𝑉 ⟶ {0,1,2, … , 𝐹𝑞 } as follows
(1967)[8] . J.A. Gallian [2] studied a complete survey on
graph labeling. David.W. and Anthony. E. Baraaukas [1] have Case 1: For 𝑛 = 3
investigated the cycle structure of Fibonacci graceful
𝑓 𝑢2 = 0
mapping. A Fibonacci graceful labeling and Super
Fibonacci graceful labeling have been introduced by 𝑓(𝑣𝑖 ) = 𝐹2𝑖 𝑓𝑜𝑟 𝑖 = 1,2
Kathiresan and Amutha [4] in 2006. S.S. Sandhya, C. David
Raj, C. Jayasekaran [8] has proved that the crown and combs 𝑓(𝑢2𝑖−1 ) = 𝐹2𝑖+1 𝑓𝑜𝑟 𝑖 = 1,2
are harmonic mean graphs. S. Karthikeyan, S. 𝑓 𝑣3 = 4 .
Navaneethakrishnan and R. Sridevi [3] proved subdivision of
bistar and are Fibonacci irregular graphs. K. Case 2 : For 𝑛 ≥ 4
Manimegalai, K. Thirusangu [6] , are proved Comb, Jellyfish,
𝑓 𝑢𝑛 = 0, 𝑓 𝑢1 = 2, 𝑓 𝑢2 = 5,
Coconut tree are pair sum graphs . N.Murugesan and
R.uma [5] have obtained some Cycle- related graphs 𝑓 𝑣𝑖 = 𝐹2𝑖 , 𝑖 = 3,4, … , 𝑛 − 1
under Fibonacci graceful.
𝑓 𝑢𝑖 = 𝐹2𝑖+1 , 𝑖 = 3,4, … , 𝑛 − 1
2. DEFINITIONS 𝑓 𝑣𝑛 = 1, 𝑓 𝑣1 = 3 , 𝑓 𝑣2 = 7.
Definition 2.1. The function 𝑓: 𝑉(𝐺) ⟶ {0,1,2 … . 𝐹𝑞 }
Then the above defined function 𝑓 admits Fibonacci graceful
(where 𝐹𝑞 is the 𝑞 𝑡ℎ Fibonacci number) is said to be labeling. Hence Combs are Fibonacci graceful .
Fibonacci graceful if the induced edge labeling 𝑓 ∗ ∶
𝐸(𝐺) ⟶ {𝐹1 , 𝐹2 , 𝐹3 , … 𝐹𝑞 } defined by 𝑓 ∗ (𝑢𝑣) = The generalized graph 𝑃𝑛 𝐴𝐾1 is shown in figure 1
𝑓(𝑢) − 𝑓(𝑣) is bijective.

Definition 2.2. The Comb is graph obtained by joining a

single pendent edge to each vertex of a path . It is denoted
by 𝑃𝑛 𝐴𝐾1 .
Definition 2.3. Let 𝑢, 𝑣 be the central vertices of 𝐵2,𝑛 . Let
𝑢1 , 𝑢2 be the vertices joined with 𝑢 and 𝑣1 , 𝑣2 , … , 𝑣𝑛 be the
vertices joined with 𝑣. Let 𝑤1 , 𝑤2 , … , 𝑤𝑛 be the vertices of the
subdivision of edges 𝑣𝑣𝑖 (1 ≤ 𝑖 ≤ 𝑛) respectively and is
denoted by (𝐵2,𝑛 𝑊𝑖 ) 1 ≤ 𝑖 ≤ 𝑛.

14
 International Journal of Computer Applications (0975 – 8887)
Volume 134 – No.15, January 2016

𝑣1 𝑣2 𝑣3 𝑣4 𝑤1 𝑒11 𝑣1
𝑣𝑛

𝑒1 𝑒2 𝑒3 𝑒4 𝑒𝑛 𝑒1 𝑣2
𝑤2 𝑒22
𝑢1 𝑒1∗ 𝑒2

𝑢1 𝑒12 𝑢2 𝑒23 𝑢3 𝑒34 𝑢4 𝑢𝑛

𝑒3 𝑤3 𝑒33 𝑣3
Figure 1. The comb graph 𝑷𝒏 𝑨𝑲𝟏

3.2 Example 𝑢 𝑒0 𝑣
The Comb 𝑃5 𝐴𝐾1 is shown in figure 2. In 𝑃5 𝐴𝐾1 , the
order is 𝑝 = 10 and the size is 𝑞 = 10.
𝑢2 𝑒2∗ 𝑒𝑛𝑛
𝑒𝑛
3 7 8 2 1
1 𝑤𝑛 𝑣𝑛

Figure 3. Subdivision of Bistar of 𝑩𝟐,𝒏 𝑾𝒊 𝟏 ≤ 𝒊 ≤

1 2 5 1 1 𝒏.
3 3.4 Example
The graph is given in figure 4 is 𝐵2,4 𝑊4 ,1 ≤ 𝑖 ≤ 𝑛. The order
2 3 5 8 13 21 34 34 0 and size is 𝑝 = 12 and 𝑞 = 11 respectively .

Figure 2. Comb 𝑷𝟓 𝑨𝑲𝟏 2 34

36
3.3 Theorem
The Subdivision of Bistar 𝐵2,𝑛 𝑤𝑖 , 1 ≤ 𝑖 ≤ 𝑛 is Fibonacci
graceful . 89 1
Proof: 89 2
3 21 24
Let 𝐵2,𝑛 𝑤𝑖 ,1 ≤ 𝑖 ≤ 𝑛 be the subdivision of Bistar, By the
definition of 𝐵2,𝑛 𝑤𝑖 ,1 ≤ 𝑖 ≤ 𝑛 the order and size is 𝑝 = 0
2𝑛 + 4 and 𝑞 = 2𝑛 + 3 respectively.The vertex set 𝑉 𝐺 = 3
𝑢, 𝑣, 𝑢1 , 𝑢2 , 𝑣1 , … , 𝑣𝑛 , 𝑤1 , … , 𝑤𝑛 . Let 𝑢, 𝑣 be the central 4 13 17
vertices of 𝐵2,𝑛 and 𝑢1 , 𝑢2 be the adjacent vertices of 𝑢 and
𝑤𝑖 ’s are the vertices which is subdivide the edge 𝑒 =
1 1
(𝑣, 𝑣𝑖 ). Hence 𝑣𝑖 ′𝑠 are adjacent to 𝑤𝑖 ′𝑠. The edge set 𝐸 𝐺 =
{𝑒𝑖∗ , 𝑒0 , 𝑒𝑖 , 𝑒𝑖𝑖 } where 𝑒1∗ = 𝑢, 𝑢𝑖 , 𝑒0 = 𝑢, 𝑣 , 𝑒𝑖 = (𝑣, 𝑤𝑖 )
55 8
and 𝑒𝑖𝑖 = (𝑤𝑖 , 𝑣𝑖 ).
5
55
Now let us define the function 𝑓: 𝑉 𝐺 → {0,1,2, … , 𝐹𝑞 } as
6 14
follows
Figure 4. Subdivision of Bistar of 𝑩𝟐,𝟒 𝑾𝟒
𝑓 𝑢 = 0, 𝑓 𝑣 = 1

𝑓 𝑢𝑖 = 𝐹𝑞−(𝑖−1) , 𝑖 = 1,2
3.5 Theorem
The Jelly fish graph 𝐽 𝑚, 𝑛 is Fibonacci graceful.
𝑓 𝑤𝑖 = 𝐹(𝑖+1) + 1, 𝑖 = 1,2, … , 𝑛 Proof
Let 𝐽(𝑚, 𝑛) be the Jellyfish graph. The order of the 𝐽 𝑚, 𝑛 is
𝑓 𝑣𝑖 = 𝑤𝑖 + 𝐹(𝑞−2)− 𝑖−1 , 𝑖 = 1,2, … , 𝑛
𝑝 = 4 + 𝑚 + 𝑛 and the size of the 𝐽(𝑚, 𝑛) is 𝑞 = 5 + 𝑚 + 𝑛.
By the definition of 𝐽 𝑚, 𝑛 , the vertex set
Then the above defined function 𝑓 admits Fibonacci
𝑉 = {𝑣1 , … , 𝑣4, 𝑢1 , 𝑢2 , … , 𝑢𝑛, 𝑤1 , … , 𝑤𝑛, }. Let 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 be
graceful labeling.
the vertices of the cycle 𝐶4 . Let 𝑢1 , 𝑢2 , … , 𝑢𝑚 be the pendant
Hence the graph 𝐵2,𝑛 𝑊𝑖 ,1 ≤ 𝑖 ≤ 𝑛 is Fibonacci graceful . vertices attaching by 𝑣2 and let 𝑤1 , 𝑤2 , … , 𝑤𝑛 be the pendant
vertices by 𝑣4 . The edge set 𝐸 𝐺 = {𝑒𝑖𝑗∗ , 𝑒2𝑖 , 𝑒1𝑖 , 𝑒3 }
The generalized graph 𝐵2,𝑛 𝑊𝑖 1 ≤ 𝑖 ≤ 𝑛 is shown in figure 3. where 𝑒𝑖𝑗∗ = (𝑣𝑖 , 𝑣𝑗 ) , 𝑒2𝑖 = 𝑣2 , 𝑢𝑖 , 𝑒1𝑖 = (𝑣1 , 𝑢𝑖 ) and
𝑒4𝑖 = (𝑣4 , 𝑤𝑖 ).

15
 International Journal of Computer Applications (0975 – 8887)
Volume 134 – No.15, January 2016

Now let us define the function 𝑓: 𝑉 ⟶ {0,1,2, … , 𝐹𝑞 } as 𝑓(𝑣𝑖 ) = 𝑖 𝑖 = 3,4

follows
Then the above defined function 𝑓 admits Fibonacci
𝑓(𝑣2 ) = 0, 𝑓(𝑣1 ) = 5 graceful labeling.
𝑓(𝑢𝑖 ) = 𝐹𝑞−(𝑖−1) 𝑖 = 1,2, … , 𝑚 Hence Jelly fish graphs are Fibonacci graceful graphs.

𝑓(𝑤𝑖 ) = 𝐹(𝑞−𝑚 )− 𝑖−1 +4 𝑖 = 1,2, … , 𝑛 The generalized graph 𝐽 𝑚, 𝑛 is shown in figure 5.

𝑤1
𝑢1
𝑣1
∗
𝑒12 ∗
𝑒41 𝑒41 𝑤2
𝑒21
𝑢2 𝑒42
∗
𝑒22 𝑒13 𝑣4 𝑤3
𝑒43
𝑣2 ∗
𝑒23 𝑒34
𝑢3 ∗ 𝑒44
𝑒2𝑚 𝑒23 𝑤4
𝑣3 𝑒4𝑛

𝑢𝑚 𝑤𝑛

Figure 5. The Jelly fish graph 𝑱(𝒎, 𝒏)

3.6 Example
The Jelly fish graph 𝐽(3, 5) is shown in figure 6. In (𝑚, 𝑛) ,
the order is 𝑝 = 12 and the size is 𝑞 = 13.

59
233
5
34 38
233 55
5 9
0 21
2 1 25
144 144
4 13
89 3 1 8
17
3
89
12

Figure 6. Jelly fish graph 𝑱(𝟑, 𝟓)

3.7 Theorem Define the function 𝑓: 𝑉 ⟶ {0,1,2, … , 𝐹𝑞 } as follows

The Coconut Trees𝐶𝑇(𝑚, 𝑛) are Fibonacci graceful for all 𝑛 𝑓 𝑢𝑚 = 0
and 𝑚 ≥ 6 .
𝑓 𝑢1 = 𝐹𝑚 −2 + 1
Proof :
𝑓(𝑣𝑖 ) = 𝐹𝑚 +(𝑖−1) 𝑖 = 1,2, … , 𝑛
Let 𝐶𝑇 (𝑚, 𝑛) be the Coconut tree. The order of the
𝐶𝑇 𝑚, 𝑛 is 𝑝 = 𝑚 + 𝑛 and the size 𝐶𝑇(𝑚, 𝑛) is 𝑞 = (𝑚 − 𝑓(𝑢𝑖 ) = 𝐹𝑖 𝑖 = 2,3, … , 𝑚 − 1
1) + 𝑛.By the definition of 𝐶𝑇(𝑚, 𝑛),the vertex set𝑉 𝐺 = Then the above defined function 𝑓 admits Fibonacci graceful
{𝑢1 , 𝑢2 , … , 𝑢𝑚 , 𝑣1 , 𝑣2 , … , 𝑣𝑛 }. Let 𝑢1 , 𝑢2 , … , 𝑢𝑚 be the labeling.
vertices of the path 𝑃𝑚 and 𝑣1 , 𝑣2 , … , 𝑣𝑛 be the pendant
vertices attaching by the end vertex of the path 𝑃𝑚 . The edge Hence Coconut Trees are Fibonacci graceful .
set 𝐸 𝐺 = 𝑒𝑚𝑖 , 𝑒𝑖𝑗 where 𝑒𝑚𝑖 = (𝑢𝑚 𝑣𝑖 ) and 𝑒𝑖𝑗 = 𝑢𝑖 𝑢𝑗 . The generalized graph is 𝐶𝑇(𝑚, 𝑛) is shown in figure 7.

16
 International Journal of Computer Applications (0975 – 8887)
Volume 134 – No.15, January 2016

4. CONCLUSION
𝑣𝑛 In this paper, we have shown that Comb, Subdivision of
Bistar, Jellyfish and Coconut Trees are Fibonacci graceful.
𝑒𝑚𝑛 In future the same process will be analyzed for other graphs.
𝑣4
𝑒 𝑚 −1 𝑚 5. ACKNOWLEDGEMENT
𝑒12 𝑒23 𝑒𝑚4 The project is supported by UGC under the minor research
𝑣3 project scheme 2014-2015.
𝑢1 𝑢2 𝑢3 𝑢𝑚 −1 𝑢𝑚 𝑒𝑚3
6. REFERENCES
𝑣2 [1] David.W and Anthony.E.Barakaukas, “Fibonacci
𝑒𝑚1 𝑒𝑚2 graceful graphs”.
[2] Joseph A. Gallian, “A Dynamic survey of graph labeling”,
𝑣1 the electronic journal of combinatorics,(2013).
[3] Kathiresan K. and Amutha S., Fibonacci graceful graphs,
Ph.D. Thesis, Madurai Kamaraj University, (October
Figure 7.The Coconut Tree 𝑪𝑻(𝒎, 𝒏)
2006).
3.8 Example [4] S. Karthikeyan, S. Navaneethakrishnan. and R. Sridevi,
The Coconut Tree 𝐶𝑇 6,5 is shown in Figure 8. In 𝐶𝑇 6,5 “Total edge Fibonacci irregular labeling of some star
the order is 𝑝 = 11 and the size is 𝑞 = 10. graphs”, International journal of Mathematics and Soft
computing , Vol 5, No.1 (2015), 73-78.

21 [5] Murugesan. N and Uma. R, “A conjecture on

3 1
4 1
Figure 8. Coconut tree 𝑪𝑻 (𝟔, 𝟓)
1 2
2 5
3 0
21 amalgation of graceful graph star graphs”, Int. J. Cont.
Math. Science,Vol.7,(2012).
5
1 [6] K. Manimekalai and K. Thirusangu, “Pair Sum Labeling
of Some Special Graphs”, International Journal of
13 3
Computer Applications (0975-8887) Volume 69, No. 8,
May 2013.
8
[7] S.S Sandhya, C. David Raj and C. Jayasekaran, “Some
8 new results on Harmonic mean Graphs”, International
Journal of Mathematics Archive-4(5), 2013, 240-245.
[8] Rosa .A, “On certain valuation of vertices of
graph”,(1967).

IJCATM : www.ijcaonline.org 17

View publication stats