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)→{1,2,.....p+q}is an injective map so that the induced edge labeling is defined byf∗(e=uv)=(f(u)−f(v))(modp+q)andf(v(G))∪f∗(e):e∈E(G)={1,2,3....p+q}.A graph that admits a SuperFelicitousDifference Labeling(SFDL) is called Super Felicitous Difference LabelingGraph. 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 𝑃2(+)𝑁2𝑛Graphand the Jewel graph