Some Graceful Labelings on Extended Duplicate Graph of Comb Graph

A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as Graceful, odd graceful, even graceful and (k,d) graceful labeling for extended duplicate graph of comb graph by presenting algorithms.