Divisor cordial labeling in the context of join and barycentric subdivision

A divisor cordial labeling of a graph G with vertex set V (G) is a bijection f from V (G) to {1,2,...,|V(G)|} such that an edge e = uv is assigned the label 1 if f(u)|f(v) or f(v)|f(u) and the label 0 otherwise, then |e f (0) - e f (1)| ≤ 1. A graph which admits divisor cordial labeling is called a divisor cordial graph. In this paper we prove that the graphs are divisor cordial graphs. In addition to this we prove that the barycentric subdivision of complete bipartite graphs K 2,n and K 3,n admit divisor cordial labeling.Publisher's Versio