DIVISOR CORDIAL LABELING IN THE CONTEXT OF JOIN AND BARYCENTRIC SUBDIVISION

Özet

Abstract. 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 |ef (0) − ef (1)| ≤ 1. A graph which admits divisor cordial labeling is called a divisor cordial graph. In this paper we prove that the graphs ACn + K1, Sn i=1Cmi + K1, Pm ∪ Sn i=1 Cmi + K1 and K1,m ∪ Sn i=1 Cmi +K1 are divisor cordial graphs. In addition to this we prove that the barycentric subdivision of complete bipartite graphs K2,n and K3,n admit divisor cordial labeling.