Abstract
In 2012, Ponraj et al. defined k-product cordial labeling as follows: Let f be a map from V (G) to {0, 1, . . . ,k - 1} where k is an integer, 1 <= k <=|V (G)|. For each edge uv assign the label f(u)f(v) (modk). f is called a k-product cordial labeling if |v(f)(i) - v(f)(j)|<= 1, and |e(f)(i) - e(f)(j)|<= 1, i,j is an element of {0, 1, . . . ,k - 1}, where v(f)(x) and e(f)(x) denote the number of vertices and edges, respectively, labeled with x (x = 0, 1, . . . ,k - 1). A graph that admits k-product cordial labeling is called k-product cordial graph. Later, we proved that several families of graphs are k-product cordial graphs. In this paper, we show that the product of graphs admit k-product cordial labeling.