July 11, 2024Open Access

Distance Antimagic Labeling of Zero-Divisor Graphs

Key Points

Key points are not available for this paper at this time.

Abstract

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.

Read Full Paperexternally

Mark Helpful

Bookmark

Relay

View Full Paper

Cite This Study

Sivakumaran et al. (Thu,) studied this question.

synapsesocial.com/papers/68e60ad1b6db64358759e2be https://doi.org/https://doi.org/10.48550/arxiv.2407.08211

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Antimagic and product antimagic graphs with pendant edges2024
2On magic type labelings of zero-divisor graphs2024
3Distance magic labelings of Cartesian products of cycles2024 · 1 citations
4Constructing the antimagic labelings for double stars union paths on three vertices2025
5Local Distance Antimagic Labeling of Generalized Mycielskian Graphs2025

Mark Helpful

Bookmark

Relay

View Full Paper