Abstract:

A total product cordial labeling of a graph \( G \) is a function \( f : V \rightarrow \{0,1\} \). For each \( xy \), assign the label \( f(x)f(y) \); \( f \) is called total product cordial labeling of \( G \) if it satisfies the condition that \( |v_f(0)+e_f(0)-v_f(1)-e_f(1)| \leq 1 \) where \( v_f(i) \) and \( e_f(i) \) denote the set of vertices and edges which are labeled with \( i = 0,1 \), respectively. A graph with a total product cordial labeling defined on it is called a total product cordial graph. In this paper, we determined the total product cordial labeling of the snake graphs \( T_n \), \( A(T_n) \), \( D(T_n) \), \( DA(T_n) \), \( Q_n \), \( A(Q_n) \), \( D(Q_n) \), and \( DA(Q_n) \).