A note on the second largest eigenvalue of the laplacian matrix of a graph

By Jiongsheng Li, Yong-Liang Pan. 2000

71 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/132ba703e6c3d255f6c946b169be8bd97481a80b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Andries E. Brouwer
2. Willem H. Haemers
3. Yaoping Hou
4. Sebastian M. Cioaba
5. Xiaodong Zhang
6. Claudio Altafini
7. Thomas Zaslavsky
8. Nathan Reff

In Discrete Mathematics and Combinatorics

1. Willem H. Haemers
2. Andries E. Brouwer
3. Ivan Gutman

In Geometry and Topology

1. Andries E. Brouwer
2. Willem H. Haemers
3. Yaoping Hou
4. Xiaodong Zhang
5. Sebastian M. Cioaba
6. Claudio Altafini
7. Thomas Zaslavsky
8. Nathan Reff

Citations in the corpus

• Spectra of Graphs (2011, background): “The cases m = 2 and m = 3 were proved earlier in [267] and [206].”
• A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo (2008, background): “The case m = 2 (μ2 d2 if the number of edges is not 1) is due to Li and Pan [4].”
• On the Laplacian Eigenvalues of Signed Graphs (2003, background): “For example, let 1⁄4 ðKn, Þ: Then 2ð Þ 1⁄4 n 2 < n 1 1⁄4 d2: Nevertheless, similar to [10] we can prove that 2ð Þ d2 1 holds.”