• SUM CORDIAL LABELING FOR SOME GRAPHS

Abstract

In this paper I investigate a new labeling called the Sum Cordial labeling and some Sum Cordial graphs. A binary vertex labeling of a graph G with induced edge labeling f* : E(G) → {0,1} defined by f*(uv) =  (f(u) + f(v) ) (mod2) is called a sum cordial labeling if   |v_f(0) -v_f(1)|≤ 1 and |e_f(0) -e_f(1)|≤ 1.Any graph which satisfies the sum cordial labeling is called a Sum Cordial graph. Here I prove some graphs like path P_n, cycle C_n , star K_1,n , bistar  B_n,n and  the graphs obtained by joining apex vertices of k copies of double stars to a new vertex  are Sum cordial graphs.