Strength–super edge-magic deficiency conjecture for trees

About 4 years old · traced to

Let TT be a nontrivial tree. A numbering of TT is a bijection f:V(T)→{1,2,…,∣V(T)∣}f:V(T)\to\{1,2,\ldots,|V(T)|\}, and its strength is

str⁡f(T)=max⁡{f(u)+f(v):uv∈E(T)}.\operatorname{str}_f(T)=\max\{f(u)+f(v):uv\in E(T)\}.

The strength of TT is

str⁡(T)=min⁡fstr⁡f(T),\operatorname{str}(T)=\min_f\operatorname{str}_f(T),

where the minimum is over all numberings, and μs(T)\mu_s(T) denotes the super edge-magic deficiency of TT. Strength–super edge-magic deficiency conjecture. For every nontrivial tree TT, there exists some positive constant cc such that

str⁡(T)≥c⋅μs(T)+∣V(T)∣+1.\operatorname{str}(T)\geq c\cdot\mu_s(T)+|V(T)|+1.

The paper notes that the known equality str⁡(T)=∣V(T)∣+1\operatorname{str}(T)=|V(T)|+1 for every nontrivial tree would make this conjecture imply the conjecture that every nontrivial tree is super edge-magic. Its status is not resolved in the source.

References

Primary source

Rikio Ichishima, S. C. López, Francesc A. Muntaner-Batle and Yukio Takahashi, “Recent studies on the super edge-magic deficiency of graphs”, arXiv:2211.04029 (2022).

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.