Christyan Tamaro Nadeak
Let G = (V, E) be a graph of order n. A bijection f : V (G) → {1, 2, · · ·, n} is called inclusive distance antimagic labeling if w(u) ≠ w(v) for any two distinct vertices u, v ∈ V (G), where w(v) = X f(x). We start our dis-x∈N[v] cussion with the connection between distance magic labeling and inclusive distance antimagic labeling. Then, we investigate the existence of an inclusive distance antimagic labeling for circulant graphs, disjoint union graphs, and join graphs. © 2026 The Indonesian Mathematical Society. All rights reserved.
Department of Data Science, Institut Teknologi Sumatera, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock