Strength–super edge-magic deficiency conjecture for trees
Strength–super edge-magic deficiency conjecture for trees
Let be a nontrivial tree. A numbering of is a bijection , and its strength is
The strength of is
where the minimum is over all numberings, and denotes the super edge-magic deficiency of . Strength–super edge-magic deficiency conjecture. For every nontrivial tree , there exists some positive constant such that
The paper notes that the known equality 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.
Sources & referencesView supporting material
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
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.