A graph $G = (V, E)$ is called singed product cordial if it is possible to label the vertex by the function $f: V \to \{-1,1\}$ and label the edges by $f^*: E \to \{-1,1\}$, where $f^*(uv) = f(u)f(v)$, $u, v \in V$ so that $|v_{-1} - v_1| \le 1$ and $|e_{-1} - e_1| \le 1$. In our work we present necessary and sufficient conditions for which the singed product cordial labeling of corona product of paths and third power of lemniscate graph.