Citation :

Anjali Yadav, Minirani S, "Distance Antimagic Labeling of Special Classes of Graphs," International Journal of Engineering Trends and Technology (IJETT), vol. 74, no. 1, pp. 298-306, 2026. Crossref, https://doi.org/10.14445/22315381/IJETT-V74I1P123

Abstract

Labeled graphs serve as a versatile mathematical model with diverse applications in engineering fields. A bijective function 𝜗:𝑉(𝐺) → {1,2,…,𝑛} is a distance antimagic labeling of a graph G with n vertices such that the vertex weights determined by 𝜔(𝑎) = ∑ 𝑏𝜖𝑁(𝑎) 𝜗(𝑏) Are unique i.e. 𝜔(𝑎) ≠ 𝜔(𝑏) for distinct vertices 𝑎,𝑏 𝜖 𝑉(𝐺) where N(a) is the open neighbourhood of vertex a in G. This paper demonstrates that distance antimagic labeling and inclusive distance antimagic labeling exist for certain special graph constructions- specifically Mycielskian graphs, splitting graphs, and shadow graphs when applied to fundamental graph classes like cycles, paths, crown graph and star graphs. Furthermore, the uniqueness of the calculated vertex weights is confirmed through a Python-Based Computational Algorithm.

Keywords

Inclusive Distance Antimagic Labeling, Distance antimagic labeling, Splitting graph, Shadow graph, Mycielski Graph.

References

[1] Anton Kotzig, and Alexander Rosa, “Magic Valuations of Finite Graphs,” Canadian Mathematical Bulletin, vol. 13, no. 4, pp. 451-461, 1970.
[CrossRef] [Google Scholar] [Publisher Link]

[2] Baskar Mari, and Ravi Sankar Jeyaraj, “Radio Labeling of Supersub-Division of Path Graphs,” IEEE Access, vol. 11, pp. 123096-123103, 2023.
[CrossRef] [Google Scholar] [Publisher Link] 

[3] Dharmendra Kumar Gurjar, and Auparajita Krishnaa, “Various Antimagic Labeled Graphs from Graph Theory for Cryptography Applications,” International Journal of Scientific Research in Mathematical and Statistical Sciences, vol. 9, no. 3, pp. 11-18, 2022.
[CrossRef] [Google Scholar] [Publisher Link] 

[4] V. Vilfred, “Σ-Labelled Graph and Circulant Graphs,” Ph.D. Thesis, University of Kerala, India (1994).
[Google Scholar]

[5] N. Kamatchi, and S. Arumugam, “Distance Antimagic Graphs,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 84, pp. 61-67, 2012.
[Google Scholar] [Publisher Link] 

[6] Dafik et al., “Inclusive Distance Antimagic Graphs,” AIP Conference Proceedings, vol. 2014, no. 1, pp. 1-9, 2018.
[CrossRef] [Google Scholar] [Publisher Link] 

[7] Jan Mycielski, “On Coloring Graphs,” Colloquium Mathematicae, vol. 3, no. 2, pp. 161-162. 1955.
[Google Scholar] 

[8] E. Sampathkumar, and H.B. Walikar, “On the Splitting Graph of a Graph,” Karnatak University, vol. 25, no. 13, pp. 13-16, 1980.
[Google Scholar]

[9] Ravindra Kuber Pawar, and Tarkeshwar Singh, “Distance Magic Labelling of Mycielskian Graphs,” Electronic Journal of Graph Theory and Applications, vol. 12, no. 1, pp. 77-88, 2024.
[CrossRef] [Google Scholar] [Publisher Link] 

[10] Maurice Genevieva Almeida, and Kingel Savia De Sa, “Local Distance Antimagic Labeling of Generalized Mycielskian Graphs,” Ars Combinatoria, vol. 164, pp. 33-55, 2025.
[CrossRef] [Google Scholar] [Publisher Link] 

[11] Anak Agung Gede Ngurah, Nur Inayah, and Mohamad Irvan Septiar Musti, “On D-Distance (Anti) Magic Labelings of Shadow Graph of Some Graphs,” Electronic Journal of Graph Theory and Applications, vol. 12, no. 1, pp. 25-34, 2024.
[CrossRef] [Google Scholar] [Publisher Link] 

[12] S. Vaidya, and N. Vyas, “Antimagic Labeling of Some Path and Cycle Related Graphs,” Annals of Pure and Applied Mathematics, vol. 3, no. 2, pp. 119-128, 2013.
[Google Scholar] [Publisher Link]