Edge product cordial labeling on duplication of prism graph

Abstract

For a graph $G =(V(G), E(G))$, an edge labeling function $f: E (G) \to \{0,1\}$  induces a vertex labeling  function $f*:V(G)  \to  \{0,1\}$ such that $f*(v)$  is the product of the labels of the edges incident to $v$. This function $f$ is called the edge product cordial labeling of  $G$  if the edges with label 1 and label 0 differ by at most 1 and the vertices with label 1 and label 0 also differ at most by 1. In this paper, we obtain an edge product cordial labeling of the duplication of prism graph.