Total Product Cordial Labeling of Generalized Dragonfly Graph Dg_n^((m,k) )

Suppose G is a graph consisting of two finite sets, namely the set of vertex V(G) and the set of edges E(G), denoted by G=(V(G),E(G)). A graph G is said to be a total product cordial graph if there exists a vertex labeling f:V(G)→{0,1} such that it induces an edge labeling f^*:E(G)→{0,1} defined by f^* (uv)=f(u)f(v) and satisfies |(v_f (0)+e_(f^* ) (0))-(v_f)|≤1. In this paper, it will be proved that the generalized dragonfly graph (Dg_n^((m,k))) is a total product cordial graph.