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

Suppose  is a graph consisting of two finite sets, namely the set of vertex  and the set of edges , denoted by . A graph  is said to be a total product cordial graph if there exists a vertex labeling  such that it induces an edge labeling  defined by  and satisfies . In this paper, it will be proved that the generalized dragonfly graph  is a total product cordial graph.

Keywords: generalized dragonfly graph, total product cordial labeling