Consider g : V (G) → {0, 1, 2} such that g() − νg(j)| ≤ 1 and |eg() − eg(j)| ≤ 1 for any ℓ, j ∈ {0, 1, 2}, where νg() denotes the number of vertices labeled with , eg() denotes the number of edges ηβ with (g(η) + g(β)) ≡ (mod 3). Then g is called total 3-sum cordial labeling. A graph with a total 3-sum cordial labeling is called a total 3-sum cordial graph. We study the total 3-sum cordial labeling of zero-divisor graphs.

This content is only available via PDF.
You do not currently have access to this content.