A sum divisor cordial labeling of a graph G with vertex set V (G) is a bijection f : V (G) → {1, 2, 3, . . . , |V (G)|} such that an edge e = uv is assigned the label 1 if2|[f(u)+f(v)] and 0 otherwise, then the number of ...