Subtract divisor cordial labeling

Abstract

A subtract divisor cordial labeling is bijection r: Z (G+) → {1,2,…,|V(G+)|} in such a way that an edge uv give the label 1 if r(u)-r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is at most 1. A graph which fulfill the condition of subtract divisor cordial labeling is called subtract divisor cordial graph. In given paper, we found ten new graphs satisfying the condition of subtract divisor cordial labeling.