On the Laplacian spectral radius of a tree

By Ji-Ming Guo. 2003

64 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/7965877c6299ae9ee9ac0d2e7eb53c9d586182ce

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. Jie Xue
2. Xing Huang
3. Huiqiu Lin
4. Xiaodong Zhang

In Geometry and Topology

1. Jie Xue
2. Xing Huang
3. Huiqiu Lin
4. Xiaodong Zhang

In Organic Chemistry

1. Xiaodong Zhang

Citations in the corpus

• A note on the $A_{\alpha}$-spectral radius of graphs (2018, background): “Hou and Li [5] and Guo [4] proved that A(n, k), n ≥ 2k, attains the maximal spectral radius, signless Laplacian spectral radius among all graphs with order n and matching number k, respectively.”
• The Laplacian eigenvalues of graphs: a survey (2011, background): “30 ([38]) Let T be a tree of order n with the matching number β(T ).”