SIGNED PRODUCT CORDIAL LABELING AND SIGNED TOTAL PRODUCT CORDIAL LABELING FOR SOME NEW GRAPHS

A vertex labeling of graph G f: V(G) →{-1,1}with induced edge labeling f*:E(G) → {-1,1} defined by f*(uv) = f(u)f(v) is called a signed product cordial labeling if |v_(f ) (-1)-v_f (1)|?1 and |e_f (-1)-e_f (1)|?1 where vf (-1) is the number of vertices labeled with ‘-1’ and vf (1) is the number of vertices labeled with ‘+1’, ef(-1) is the number of edges labeled with ‘-1’ and ef(1) is the number of edges labeled with ‘+1’. A graph G is signed product cordial if it admits signed product cordial labeling and Total signed product cordial labeling