Kamatchi–Arumugam tree characterization conjecture for distance-antimagic trees
Kamatchi–Arumugam tree characterization conjecture for distance-antimagic trees
Let be a tree. A tree is distance antimagic if it admits a bijection whose vertex weights
are distinct. A support vertex is a vertex adjacent to at least one leaf.
Kamatchi–Arumugam tree conjecture. is distance antimagic if and only if every support vertex has precisely one leaf adjacent to .
The source explicitly describes this as one of the conjectures put forward by Kamatchi and Arumugam and says that these conjectures were yet open. It gives a proposed structural characterization of distance-antimagic trees.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Divya T and Devi Yamini S, “Local Distance Antimagic Vertex Coloring of Graphs”, arXiv:2106.01833 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.