graceful labeling of merge graph , bistar graph, friendship graph, Cdn relation graph

Abstract

Let G be a graph. The graceful labeling of a graph with ‘m’ vertices and ‘n’ edges is a injective function such that the induced function is given by, then the resulting edge labels are distinct. In this paper we investigate some result graceful labeling of merge graph, bistar graph, friendship graph, (graph obtained by adding a pendent edge for each vertex of the cycle, (A cycle with non-intersecting chords).