de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
By Jiongsheng Li, Yong-Liang Pan. 2001
72 citations recorded by the source corpus.
Subfields: Cellular and Molecular Neuroscience, Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/3fea2900b06aa4bf14b59ce047596787cd78848c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Cellular and Molecular Neuroscience
In Computational Theory and Mathematics
In Geometry and Topology
Citations in the corpus
- Two sharp upper bounds for the Laplacian eigenvalues (2004, unknown): “In 2001, Li and Pan [6] showed that λ(G) max {√ 2d(v)(d(v)+m(v)) |v ∈ V (G)}.”
- The Laplacian eigenvalues of graphs: a survey (2011, background): “8 ([56]) Let G be a simple connected graph.”