Sum Divisor Cordial Labeling on Some Classes of Graphs

A. Sugumaran and K. Rajesh*

Department of Mathematics, Government Arts College, Tiruvannamalai-606603, Tamilnadu, INDIA.

DOI : http://dx.doi.org/10.29055/jcms/1011


A sum divisor cordial labeling of a graph G with vertex set V(G) is a bijection f :V(G) 1,2,...,|V(G) | 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 which satisfying sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that the graphs such as Drums ( 3) n D n , Twig m T , Fire crackers n n P S ( n is even ) and Double arrow n m DA ( n is even), |m n | 1 are sum divisor cordial graphs. AMS Mathematics Subject Classification(2010): 05C78.

Keywords :Divisor Cordial, Sum divisor cordial labeling, Drums graph.

map1 map2 map3