MULTIPLY DIVISOR CORDIAL LABELING IN CONTEXT OF RING SUM OF GRAPHS

J. T. Gondalia and A. H. Rokad

  DOI:  https://doi.org/10.37418/amsj.9.11.8

Full Text

Multiply divisor cordial labeling of a graph $G^*$ having set of node $V^*$ is a bijective $h$ from V($G^*$) to \{1,2,\ldots,|V($G^*$)|\} such that an edge $xy$ is assigned the label 1 if 2 divides $(h(x)\cdot h(y))$ and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph having multiply divisor cordial labeling is said to be multiply divisor cordial graph. In this paper, we have recognized seven new graph families by which the conditions of multiply divisor cordial labeling in context of ring sum of graphs are satisfied.

Keywords: Multiply divisor cordial labeling, Double Wheel, Double Fan, helm.