You and Liu's Laplacian spectral ratio conjecture for trees
Let be a tree with vertices. The Laplacian spectral ratio is
where and are the largest and second smallest Laplacian eigenvalues of a connected graph . You and Liu's conjecture.
and the left equality holds if and only if , while the right equality holds if and only if . This conjecture proposes that among trees on vertices the star minimizes and the path maximizes the Laplacian spectral ratio; the source notes that conditions in terms of diameter and maximum degree had been established, but provides no resolution of the full conjecture.
References
- Zhen Lin, Jiajia Wang and Min Cai, “The Laplacian spectral ratio of connected graphs”, arXiv:2302.10491 (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.