An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree

Linear Algebra and Its Applications

Volumn 427, Issue 1, 2007, Pages 138-150

  Rojo, Oscar ^a   Robbiano, María ^a  

^a UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Adjacency matrix; Bethe trees; Laplacian matrix; Largest eigenvalue; Radius; Tree

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FORESTRY; LAPLACE TRANSFORMS; TREES (MATHEMATICS);

ADJACENCY MATRICES; BETHE TREES; LAPLACIAN MATRICES; LARGEST EIGENVALUES; RADIUS; TREE;

MATRIX ALGEBRA;

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

References (7)

1. G.H. Golub, C.F. Van. Loan, Matrix Computations, second ed., Johns Hopkins University Press, Baltimore, 1989.
2. S. Kouachi, Eigenvalues and eigenvectors of tridiagonal matrices, Electron. J. Linear Algebra 15 (April) (2006) 115-133.
3. O. Rojo, R. Soto, The spectra of the adjacency matrix and Laplacian matrix for some balanced trees, Linear Algebra Appl. 403 (2005) 97-117. (Pubitemid 40684171)
4. O. Rojo, The spectra of some trees and bounds for the largest eigenvalue of any tree, Linear Algebra Appl. 4.14 (2006) 199-217. (Pubitemid 43276495)
5. D. Stevanović, Bounding the largest eigenvalue of trees in terms of the largest vertex degree, Linear Algebra Appl. 360 (2003) 35-42. (Pubitemid 35464312)
6. R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, 1965.
7. F. Zhang, Matrix Theory, Springer, 1999.