3-Total Edge Product Cordial Labeling for Stellation of Square Grid Graph

Let G be a simple graph with vertex set V(G) and edge set E(G). An edge labeling delta:E(G) ? {0,1, horizontal ellipsis ,p-1}, where p is an integer, 1 & LE;p & LE;[E(G)], induces a vertex labeling delta*:V(H) ? {0,1, horizontal ellipsis ,p-1} defined by delta*(v)=delta(e(1))delta(e(2)).delta(e(n))(modp), where e(1),e(2), horizontal ellipsis ,e(n) are edges incident to v. The labeling delta is said to be p-total edge product cordial (TEPC) labeling of G if e(delta)(i)+v(delta)*(i)-(e(delta)(j)+v(delta)*(j)& LE;1 for every i,j, 0 & LE;i & LE;j & LE;p-1, where e(delta)(i) and v(delta)*(i) are numbers of edges and vertices labeled with integer i, respectively. In this paper, we have proved that the stellation of square grid graph admits a 3-total edge product cordial labeling.