Multiply Divisor Cordial Labeling

A Graph G* having multiply divisor cordial labeling with node set V* is a bijective. t on V * to {1,2,…,V * } such that an edge ab is allocate the label 1 if 2 divides (t (a) t (b)) and 0 otherwise, then the number of edges having label 0 and the number of edges having label 1 differ by maximum 1. A graph having multiply divisor cordial labeling is said to be multiply divisor cordial graph. In this paper, we prove that cycle, cycle having 1 chord, cycle having 2 chords, cycle having triangle, path, jellyfish, coconut tree, star and bistar graph are multiply divisor cordial graphs.