A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

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 …