Abstract

A graph is said to be Super Fibonacci graceful if the function 𝑓 is defined as 𝑓: 𝑉(𝐺) ⟶ {0, 𝐹1 , 𝐹2 , … , 𝐹𝑞 } and the induced edge labeling 𝑓 ∗ ∶ 𝐸(𝐺) ⟶ {𝐹1 , 𝐹2 , 𝐹3 , … , 𝐹𝑞 } defined as 𝑓 ∗ (𝑢𝑣) = 𝑓(𝑢)− 𝑓(𝑣) is bijective. In this paper an analysis is made on Shell, Shell-flower and Bow graphs under Super Fibonacci graceful graphs.

Keywords

References

[1] David.W and Anthony.E.Barakaukas, “Fibonacci graceful graphs”.
[2] Harary.F, “Graph Theory”, Narosa Publishing House (2001).
[3] Joseph A. Gallian, “A Dynamic survey of graph labeling”, the electronic journal of combinatorics,(2013).
[4] Jeba Jesintha .J. Ezhilarasi Hilda Stanley “ Graceful labeling of Bow graphs and Shell-flower graphs”
[5] Kathiresan K. and Amutha S., Fibonacci graceful graphs, Ph.D. Thesis, Madurai Kamaraj University, (October 2006).
[6] Murugesan. N and Uma. R, “A conjecture on amalgation of graceful graphs star graphs”, Int. J. Cont. Math. Science,Vol.7,(2012).
[7] Rosa.A, “On certain valuation of vertices of graph”,(1967).
[8] D.Amuthavalli “Super Fibonacci graceful labeling of some cycle related graphs”,Int. J. Mathematics Trends and Technology.(2016).