Distance Antimagic Labeling of Zero-Divisor Graphs

In this paper, we prove that for all m 1 and n=1, the graph m (Z₉) +n (Z₄), for all n 1, and m=1, the graph m (Z₆) +n (Z₉), for all m1, m (Z₉) + (Z₄) (Z₉), for all prime m3, (Z₆) (Z₂₌) and (Z₆) (Z₌ℂ) are all admit distance antimagic labeling.