Premalatha et al.'s local antimagic conjecture for connected graphs
Premalatha et al.'s local antimagic conjecture for connected graphs
Let be a finite connected graph with no isolated vertices, and let be a bijection. For each vertex , define its weight by
where is the set of edges incident with . The labeling is local antimagic when for every edge . Premalatha et al.'s local antimagic conjecture. Every connected graph other than is local antimagic. The source notes that antimagic graphs are local antimagic, but gives no resolution status for this conjecture.
Sources & referencesView supporting material
Primary source
C. R. Pavithra, A. V. Prajeesh and V. S. Sarath, “Local antimagic chromatic number of partite graphs”, arXiv:2308.07278 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.