Hartsfield's antimagic conjecture for connected graphs
Hartsfield's antimagic conjecture for connected graphs
Let be a connected graph. An antimagic labeling of is a bijection such that the vertex weights
are distinct for every pair of distinct vertices . Hartsfield's antimagic conjecture. Every connected graph other than is antimagic, meaning that it admits an antimagic labeling. This is one of the principal open conjectures on antimagic graph labelings and would establish the existence of such a labeling for every connected graph except the single edge.
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
Gee-Choon Lau, K. Premalatha, S. Arumugam and Wai-Chee Shiu, “On local antimagic chromatic number of cycle-related join graphs II”, arXiv:2112.04142 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.