FIBONACCI PRIME LABELING OF SNAKE GRAPH

Here we describe the Snake related graph into a Fibonacci prime Graph by the following condition, If there exist a one-to-one mapping between the vertex set and the fibonacci numbers then there is a mapping between edge set and natural numbers where the end points of the edges are relatively prime. This work is a continuation of S. Chandrakala, Dr. C. Sekar who introduced Fibonacci Prime Labeling. We represent Fibonacci Prime Labeling as \textsl{(FPL)}, Fibonacci Prime Graph as \textsl{(FPG)}.