Some E-Cordial 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 E- cordial, total E- cordial, product E-cordial, total product E-cordial, Prime E- cordial and E₃- cordial labeling for the extended duplicate graph of Comb graph by presenting algorithms.