k-Product Cordial Labeling of Graphs
Raja Ponraj, M. Sivakumar · 2012
In this paper we introduce a new graph labeling known as k-Product cordial labeling of graphs.Let f be a map from V(G)to{0,1,...k-1}where k is an integer,1≤k≤ . V(G) For each edgeuv assign the label f(u) f(v)( mod k). f is called a kProduct cordial labeling if , 1 (j) v (i) v f f ≤ and , 1 (j) e (i) e f f ≤ i,j∈ {0,1,..k-1},where vf(x) and ef(x) denote the number of vertices and edges respectively labeled with x (x=0,1,2,3.....k-1).We investigatethe k-Product cordial labeling behavior of stars, bistars and also the 4-Product cordial labeling behavior of paths,complete graphs, and combs.