4-Square Sum E-Cordial Labeling for Some Graphs

Abstract

Let G(V,E) be a simple graph and let f:E(G)?{1,2,3,4} be a mapping with the induced labeling f^*:V(G)?{0,1} defined by f^* (u)=???{(f(uv))^2/uv?E(G)}(mod 2)? then f is called a 4-square sum E-cordial labeling if |v_f (0)-v_f (1)|?1 and |e_f (i)-e_f (j)|?1 where v_f (0) and v_f (1) is the number of vertices labeled with 0 and labeled with 1; e_f (i) and e_f (j) is the number of edges labeled with i and labeled with j respectively. A graph which admits 4-square sum E-cordial labeling is called 4-square sum E-cordial graph.