A majorization bound for the eigenvalues of some graph Laplacians
classification
🧮 math.CO
keywords
conjecturegraphgraphsmajorizationboundboundaryclassconditions
read the original abstract
It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this conjecture to graphs with Dirichlet boundary conditions is equivalent to the original conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.