• A. Sahaya Rani
• P. Maya
• T. Nicholas

In this paper we introduce the concept of product integer cordial labeling. Let G(V, E) be a simple connected graph with p vertices. Let the injective mapping f: V → {1, 2, . . ., p} induce an edge labeling f* on E such that f*(uv) = 1 or 0 according as f(u)f(v) even or odd respectively. Let ef(i) = number of edges labeled with i, where i = 0 or 1. We call f a product integer cordial if |ef(0) – ef(1)| ≤ 1. A graph G is called product integer cordial if it admits a product integer cordial labeling. We also investigate the product integer cordial labeling of some graphs.

Cordial, Integer cordial, Product integer cordial labeling.

"Product Integer Cordial Labeling Of Some Well Known Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 11, page no.132-138, November-2018, Available :http://www.jetir.org/papers/JETIR1811022.pdf

"Product Integer Cordial Labeling Of Some Well Known Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 11, page no. pp132-138, November-2018, Available at : http://www.jetir.org/papers/JETIR1811022.pdf