Some E-Cordial Labelings on Extended Duplicate Graph of Comb Graph
K. Sutha *
Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai – 600 073, India.
K. Thirusangu
Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai – 600 073, India.
S. Bala
Department of Mathematics, S. I. V. E. T. College, Gowrivakkam, Chennai – 600 073, India.
*Author to whom correspondence should be addressed.
Abstract
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 E3- cordial labeling for the extended duplicate graph of Comb graph by presenting algorithms.
Keywords: Graph labeling, comb graph, duplicate graph