Cordial and Mean 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 cordial, total cordial, product cordial, total product cordial, prime cordial, odd mean labeling and even mean labeling for extended duplicate graph of Comb graph by presenting algorithms.