Super Felicitous Difference Labeling of Special Types of Graphs

Abstract

A graph with p vertices and q edges is called super felicitous difference labeling graph if f: V (G) is an injective map so that the induced edge labeling is defined by and . A graph that admits a SuperFelicitous Difference Labeling (SFDL) is called Super Felicitous Difference Labeling Graph.  In this paper, we investigate super felicitous difference labeling graph of special types of trees like the Jelly fish, thespider graph, the Globe graph Gl(n), the ladder graph,the graph, , the  Graph and the Jewel graph.