Super Fibonacci Graceful Labeling of Friendship and Windmill Graph

Abstract

The Fibonacci series is utilized to produce Fibonacci in a recursive grouping.  To find, the arrangement which is produced by including the past two terms is known as a Fibonacci arrangement.  The first two term of the Fibonacci arrangement is set as 0 and 1 and it proceeds till boundlessness.  And this paper we discuss about the Fibonacci number and its function h :V(G)?{0,F1,F2,…….Fq} is said as super Fibonacci graceful, then the induced edge labeling f*: E(G)?{F1,F2,F3,….Fq} and it is characterized by h*(ab)=?h(a)h(b)?is bijective.  And also the Cycle in Friendship graph and Dutch windmill graph, butterfly graph and   graphs are interrogated.  And also few examples are given to show the result of the theory.