Some edge product cordial graphs

For a graph $G=(V(G), E(G))$, a function $ f : E(G) rightarrow {0, 1}$ is called an edge product cordial labeling of $G$ if the induced vertex labeling function defined by the product of incident edge labels be such that the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 and label 0 also differ by at most 1. In this paper we investigate some new families of edge product cordial graph.