Saito–Woei's plateaux conjecture for graph Laplacian eigenvalues
Statement
Let be a simple graph. A pendant path of is a path such that one of its end vertices has degree , the other end has degree at least , and all its internal vertices have degree . For a positive integer , let be the number of pendant paths of length in , and let be the number of vertices of degree at least that are an end vertex of some pendant path of length .
Saito–Woei's plateaux conjecture. For any positive integer and any graph , some Laplacian eigenvalue of has multiplicity at least
The conjecture arose from the study of Laplacian eigenvalue multiplicities in dendritic trees. The source paper states that it follows from a more general result for both Laplacian and signless Laplacian eigenvalues.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.