Premalatha et al.'s local antimagic conjecture for connected graphs

Let G=(V,E)G=(V,E) be a finite connected graph with no isolated vertices, and let f:E{1,2,,E}f:E\to\{1,2,\ldots,|E|\} be a bijection. For each vertex uVu\in V, define its weight by

w(u)=eE(u)f(e),w(u)=\sum_{e\in E(u)}f(e),

where E(u)E(u) is the set of edges incident with uu. The labeling ff is local antimagic when w(u)w(v)w(u)\neq w(v) for every edge uvEuv\in E. Premalatha et al.'s local antimagic conjecture. Every connected graph other than K2K_2 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.