Improved bounds for the largest eigenvalue of trees

Linear Algebra and Its Applications

Volumn 404, Issue 1-3, 2005, Pages 297-304

  Rojo, Oscar ^a  

^a UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Adjacency matrix; Laplacian matrix; Largest eigenvalue; Tree

Indexed keywords

BOUNDARY CONDITIONS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; THEOREM PROVING;

LAPLACIAN MATRIX; LARGEST EIGENVALUES; SUBGRAPHS; TREE;

TREES (MATHEMATICS);

EID: 20344362633     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2005.02.023     Document Type: Article

References (3)

1. D. Stevanović Bounding the largest eigenvalue of trees in terms of the largest vertex degree Linear Algebra Appl. 360 2003 35 42
2. O. Rojo, R. Soto, The spectra of the adjacency matrix and Laplacian matrix for some balanced trees, Linear Algebra Appl., in press (doi:10.1016/j.laa.2005.01.011)
3. O.J. Heilmann, and E.H. Lieb Theory of monomer-dimer systems Comm. Math. Phys. 25 1972 190 232