Infinite minimal Laplacian-tree conjecture
Let be a Laplacian eigenvalue of some tree , with . Let and denote the two classes of minimal Laplacian trees used in the source, and let denote the stated norm. Infinite minimal Laplacian-tree conjecture. If , then
If , then
The claim predicts infinitely many minimal trees in the indicated classes, while the preceding discussion states that the class with superscript is empty when . The supplied text gives no resolution status.
References
Primary source
Asghar Bahmani and Dariush Kiani, “Structure of Trees with Respect to Nodal Vertex Sets”, arXiv:1907.12062 (2020).
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.