SQUARE DIVISOR CORDIAL LABELING FOR SOME GRAPHS

Let G = {V (G), E (G)} be a simple graph and f: v→ {1, 2. . . |v|} be a bijection. For each edge uv, assign the label 1. If either [ ? ( ? ) ] 2 / ? ( ? ) or [ ? ( ? ) ] 2 / ? ( ? ) and the label 0 otherwise f is called a square divisor cordial labeling if | ? ? ( 0 ) − ? ? ( 1 ) | ? 1 . A graph with a square divisor cordial labeling is called a square divisor cordial graph. In this work, a discussion is made on Shell, Tensor product, Coconut tree, Jelly fish and Subdivision of bistar under square divisor cordial labeling