Bounding the largest eigenvalue of trees in terms of the largest vertex degree

By Dragan Stevanovic. 2003

68 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/340bde28d8ea05cbaebf97efa8b9cb30a0d923eb

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. Xiaodong Zhang
2. Oscar Rojo
3. Germain Pastén
4. Vladimir Nikiforov
5. Ricardo L. Soto
6. Zoran Stanic
7. L. Lov'asz
8. Peter Rowlinson

In Geometry and Topology

1. Xiaodong Zhang
2. Oscar Rojo
3. Vladimir Nikiforov
4. Germain Pastén
5. Ricardo L. Soto
6. Zoran Stanic
7. Yongtao Li
8. L. Lov'asz

In Organic Chemistry

1. Xiaodong Zhang
2. Vladimir Nikiforov
3. Oscar Rojo
4. Zoran Stanic

Citations in the corpus

• On the $A_{\alpha}$-spectra of trees (2016, background): “Independently, Stevanovi´c [13] also proposed a self-contained calculation, and, in addition, proved the tight bound which was stated for the spectral radius ρ ( L ( T ∆ )) of the Laplacian of T ∆ , but since trees are bipartite graphs, we have ρ ( Q ( T ∆ )) = ρ ( L ( T ∆ )) .”
• The Laplacian eigenvalues of graphs: a survey (2011, background): “25 ([87]) Let T be a tree with the largest vertex degree ∆.”