Infinite minimal Laplacian-tree conjecture

From papers

Let μ\mu be a Laplacian eigenvalue of some tree TT, with μ1\mu\neq 1. Let LTmin,μ0\mathcal{LT}_{\mathrm{min},\mu}^{0} and LTmin,μ1\mathcal{LT}_{\mathrm{min},\mu}^{1} denote the two classes of minimal Laplacian trees used in the source, and let Norm(μ)\operatorname{Norm}(\mu) denote the stated norm. Infinite minimal Laplacian-tree conjecture. If Norm(μ)=1\operatorname{Norm}(\mu)=1, then

LTmin,μ0=LTmin,μ1=+.|\mathcal{LT}_{\mathrm{min},\mu}^{0}|=|\mathcal{LT}_{\mathrm{min},\mu}^{1}|=+\infty.

If Norm(μ)>1\operatorname{Norm}(\mu)>1, then

LTmin,μ0=+.|\mathcal{LT}_{\mathrm{min},\mu}^{0}|=+\infty.

The claim predicts infinitely many minimal trees in the indicated classes, while the preceding discussion states that the class with superscript 11 is empty when Norm(μ)>1\operatorname{Norm}(\mu)>1. The supplied text gives no resolution status.

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

Asghar Bahmani and Dariush Kiani, “Structure of Trees with Respect to Nodal Vertex Sets”, arXiv:1907.12062 (2020).

Solutions 0

No solutions have been posted yet.