\(4\)-Total Prime Cordial Labeling of Some Derived Graphs

Let \(G\) be a \((p, q)\) graph. Let \(f: V(G) → \{1, 2, …, k\}\) be a map where \(k ∈ N\) is a variable and \(k > 1\). For each edge \(uv\), assign the label \((f(u), f(v))\). \(f\) is called \(k\)-Total prime cordial labeling of \(G\) if \(|tf(i) – tf(j)| ≤ 1\), \(i, j ∈ \{1, 2, …, k\}\) where \(tf(x)\) denotes the total number of vertices and edges labeled with \(x\). A graph with a \(k\)-total prime cordial labeling is called \(k\)-total prime cordial graph. In this paper, we investigate the 4-total prime cordial labeling of some graphs like dragon, Möbius ladder, and corona of some graphs.