Abstract. 

Let G be the a graph. An Edouard Product Cordial Labeling (EPCL) of a graph G with |V (G)| = n is an injective function f : V (G) → {E0, E1, E2, . . . , En−1} where Ei is the ith Edouard number (i = 0, 1, 2, 3, . . . , n) that induced a function f∗ defined by f∗(uv) = (f(u)f(v)) (mod 2) for all edge e = uv such that |e∗f(0) − e∗f(1)| ≤ 1 where e∗f(0) is the number of verticeslabeled with 0 and e∗f(1) is the number of vertices labeled with 1. The graph that satisfies the condition of a edouard product cordial labeling is called an edouard product cordial graph (EPCG).