Abstract In 1967, Rosa [5] introduced β-valuation labeling of a graph. Golomb [20]
subsequently called such labeling as a graceful labeling. In 1980, Graham and Sloane [15] …

Abstract In 1987, Cahit [4] introduced cordial labeling as a weaker version of graceful
labeling and harmonious labeling. In 2011, Varatharajan et al.[8] have introduced divisor …

For a graph G=(V (G), E (G)), the vertex labeling function is defined as a bijection f: V
(G)→{1, 2,...,| V (G)|} such that an edge uv is assigned the label 1 if one f (u) or f (v) divides …

In 1987, Cahit [7] introduced cordial labeling as a weaker version of graceful labeling and
harmonious labeling. In 2011, Varatharajan et al.[16] have introduced divisor cordial …