The spectrum of the Laplacian matrix of a balanced binary tree

Linear Algebra and Its Applications

Volumn 349, Issue 1-3, 2002, Pages 203-219

  Rojo, Oscar ^a  

^a UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Algebraic connectivity; Binary trees; Laplacian matrix

Indexed keywords

ALGEBRA; BINARY TREES; LAPLACE TRANSFORMS; LINEAR ALGEBRA; MATRIX ALGEBRA;

ALGEBRAIC CONNECTIVITY; BALANCED BINARY TREE; EIGEN-VALUE; LAPLACIAN MATRICES; LARGEST EIGENVALUES; LOWER AND UPPER BOUNDS; SECOND LARGEST EIGENVALUE; SMALLEST EIGENVALUE;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 31244437758     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00256-2     Document Type: Article

References (7)

1. R. Merris Laplacian matrices of graphs: a survey Linear Algebra Appl. 197 198 1994 143 176
2. M. Fiedler Algebraic connectivity of graphs Czechoslovak Math. J. 23 1973 298 305
3. J.J. Molitierno, M. Neumann, and B.L. Shader Tight bounds on the algebraic connectivity of a balanced binary tree Electron. J. Linear Algebra 6 2000 62 71
4. A. Cantoni, and P. Butler Eigenvalues and eigenvectors of symmetric centrosymmetric matrices Linear Algebra Appl. 13 1976 275 288
5. L.N. Trefethen, and D. Bau III Numerical linear algebra Soc. Indust. Appl. Math. 1997
6. G.H. Golub, and C.F. Van Loan Matrix Computations second ed. 1989 Johns Hopkins University Press Baltimore
7. R.A. Horn, and C.R. Johnson Matrix Analysis 1991 Cambridge University Press Cambridge