Sum Divisor Cordial Labeling of Certain Graphs

Abstract

A  sum divisor cordial labeling of a graph with vertex set  is bijection  from  such that an edge  is assingned the label 1 if 2 divides and 0 otherwise; and the number of edges labeled with  and the number of edges labeled with  differ by atmost . A graph with sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that splitting graph of path graph  , shadow graph of cycle union shell graph    , corona product of  and sunlet   graph  are sum divisor cordial graphs.