3-total edge product cordial labeling of wheel related graphs

For a graph G = (V (G), E(G)), an edge labeling function f : E(G) -> {0, 1, ..., k - 1} where k is an integer, 2 <= k <= vertical bar E(G)vertical bar, induces a vertex labeling function f* : V (G) -> {0, 1, ..., k - 1} such that f* (v) is the product of the labels of the edges incident to v (mod k). This function f is called k-total edge product cordial (or simply k-TEPC) labeling of G if vertical bar(v(f)(i) + e(f) (i)) - (v(f) (j) + e(f)(j))vertical bar <= 1 for all i, j is an element of {0, 1, ..., k - 1}. In this paper, 3-total edge product cordial labeling for wheel related graphs is determined.