DIVIDED SQUARE DIFFERENCE CORDIAL LABELING GRAPHS

Let
,  be a simple graph and :  → 1,2,3, … || be bijection. For each edge , assign the label 1 if       is odd and the label 0 otherwise. f is called Divided square difference Cordial Labeling if  0   1  1, where  1 !"  0 denote the number of edges labeled with 1 and not labeled with 1 respectively. In this paper, the concepts of Divided square difference cordial labeling behavior of path, cycle, #$,%, #&,%, '% ( #$ and '% ( 2#$ are introduced.