SUPER FELICITOUS DIFFERENCE LABELING GRAPH

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 .  In this paper, we prove that Path, Cycle, Complete Bipartite Graph, Fan, Comb, Star graph are Super Felicitous Difference Labeling Graph. As a consequence, some families of graphs are shown to be non – Super felicitous difference labeling.