Some New Results on Sum Divisor Cordial Graphs
Arunachalam Sugumaran, K. Rajesh · Annals of Pure and Applied Mathematics · 2017
such that each edge uv assigned the label 1 if 2 divides ( ) ( ) f u f v + and 0 otherwise.Further, the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.A graph with a sum divisor cordial labeling is called a sum divisor cordial graph.In this paper, we prove that Swastik graph n Sw , path union of finite copies of Swastik graph n Sw , cycle of k copies of Swastik graph n Sw ( k is odd), Jelly fish ( , ) J n n and Petersen graph are sum divisor cordial graphs.