On Distance Antimagic Graphs

Rinovia Simanjuntak, Kristiana Wijaya

For an arbitrary set of distances $D\subseteq \{0,1,\dots ,diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\to \{1,2,\dots ,v\}$ is…