Main Article Content
A Sum Square Divisor Cordial labeling of a graph with a collection of vertex is a bijection from to , where an edge is assigned the value 1 if 2 divides and the edge is assigned the value 0 if 2 does not divides . The number of edges labeled with 0 and the number of edges labeled with 1 differ by no more than 1. A graph with a sum square divisor cordial labeling is called a Sum SquareDivisor Cordial Graph. This study establishes that Theta graph , Fusion of any two vertices in the cycle , duplication of any vertex in the cycle of , switching of a central vertex in , path union of two copies of , star of Theta graph are sum square divisor cordial graphs.