DIVISOR CORDIAL LABELING IN THE CONTEXT OF JOIN AND BARYCENTRIC SUBDIVISION

Abstract

A divisor cordial labeling of a graph G with vertex set V G is a bijectionf from V G to {1, 2, . . . , |V G |} such that an edge e = uv is assigned the label 1 iff u |f v or f v |f u and the label 0 otherwise, then |ef 0 − ef 1 | ≤ 1. A graphwhich admits divisor cordial labeling is called a divisor cordial graph. In this paper weprove that the graphs ACn+ K,n SC mi i=1 + K1, Pm∪SCmin i=1 + K1andK1,m∪ n SC mi+K1are divisor cordial graphs. In addition to this we prove that the barycentrici=1 subdivision of complete bipartite graphs K2,nand K3,nadmit divisor cordial labeling