3-product cordial labeling

Abstract

A mapping $f:V(G)\to \{0,1,2\}$ is called a 3-product cordial labeling if $|v_f(i)-v_f(j)|\le 1$ and $|e_f(i)-e_f(j)|\le 1$ for any $i,j\in \{0,1,2\}$, where $v_f(i)$ denotes the number of vertices labeled with $i,e_f(i)$ denotes the number of edges $xy$ with $f(x)f(y)\equiv i(mod3)$. A graph with a 3-product cordial labeling is called a 3-product cordial graph. In this paper, we investigate the 3-product cordial behaviour for some standard graphs.