Answers are grounded in this paper and cite their sources.
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 m≥1, [mΓ(Z₉)+Γ(Z₄)]× Γ(Z₉), for all prime m≥3, Γ(Z₆)×Γ(Z₂ₘ) and Γ(Z₆)×Γ(Zm²) are all admit distance antimagic labeling.
No takes yet. Share an insight, caveat, or question.
Sivakumaran et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: