Further Results on Sum Divisor Cordial Labeling

A. Sugumaran and K. Rajesh

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

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


A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {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 with a sum divisor cordial labeling is called a sum divisor cordial graph. In this paper, we prove that n H ( n is odd), 3 1, @ n C K , < 1 2 n n F F  >, open star of Swastik graphs ( . ) n S t Sw when t is odd, are sum divisor cordial graphs. AMS Mathematics Subject Classification (2010): 05C78.

Keywords :Divisor cordial labeling, sum divisor cordial labeling.

map1 map2 map3