Super fibonacci graceful anti – magic labeling for flower graphs and python coding

Abstract

A graph vertices and  edges. A super fibonacci graceful anti-magic labeling  of is an injective function   such that  the induced edge labeling  is a bijection onto the set   In addition, all the vertex sums are pairwise distinct and all the edges are unique.  If a graph  admits a super fibonacci graceful anti magic labeling  then  is called super fibonacci graceful anti- magic graph In this article the concept of super fibonacci graceful anti- magic labeling is introduced and investigated with some flower graphs. These graphs are called super fibonacci graceful anti magic graph .