Sum divisor cordial labeling in the context of graphs operations on bistar

Abstract

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 edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph admits a sum divisor cordial labeling, then it is called sum divisor cordial graph. In this paper we prove that bistar Bm,n, splitting graph of bistar Bm,n, degree splitting graph of bistar Bm,n, shadow graph of bistar Bm,n, restricted square graph of bistar Bm,n, barycentric subdivision of bistar Bm,n and corona product of bistar Bm,n with K₁ admit sum divisor cordial labeling.