Syafrizal Sy, Rinovia Simanjuntak, Tamaro Nadeak, Kiki Ariyanti Sugeng, Tulus Tulus
A distance antimagic labeling of graph G = (V, E) of order n is a bijection f: V(G) → {1, 2, …, n} with the property that any two distinct vertices x and y satisfy ω(x) ≠ ω(y), where ω(x) denotes the open neighborhood sum ∑a∈N(x) f(a) of a vertex x. In 2013, Kamatchi and Arumugam conjectured that a graph admits a distance antimagic labeling if and only if it contains no two vertices with the same open neighborhood. A circulant graph C(n; S) is a Cayley graph with order n and generating set S, whose adjacency matrix is circulant. This paper provides partial evidence for the conjecture above by presenting distance antimagic labeling for some circulant graphs. In particular, we completely characterized distance antimagic circulant graphs with one generator and distance antimagic circulant graphs C(n; {1, k}) with odd n. © 2024 the Author(s), licensee AIMS Press.
Department of Mathematics and Data Science, Universitas Andalas, Indonesia; Combinatorial Mathematics Research Group, Institut Teknologi Bandung, Indonesia; Department of Data Science, Institut Teknologi Sumatera, Indonesia; Department of Mathematics, Universitas Indonesia, Indonesia; Department of Mathematics, Universitas Sumatera Utara, Indonesia; Center for Research Collaboration on Graph Theory and Combinatorics, 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