The spectra of the adjacency matrix and Laplacian matrix for some balanced trees

Linear Algebra and Its Applications

Volumn 403, Issue 1-3, 2005, Pages 97-117

  Rojo, Oscar ^a   Soto, Ricardo ^a  

^a UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Adjacency matrix; Balanced tree; Binary tree; Laplacian matrix; m Ary tree; Tree

Indexed keywords

BINARY SEQUENCES; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; LAPLACE TRANSFORMS; MATRIX ALGEBRA; SET THEORY;

ADJACENCY MATRIX; BALANCED TREE; BINARY TREE; LAPLACIAN MATRIX; M-ARY TREE;

TREES (MATHEMATICS);

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

References (7)

1. L.N. Trefethen, D. Bau III, Numerical Linear Algebra, Society for Industrial and Applied Mathematics, 1997.
2. M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Math. J. 23 (1973) 298-305.
3. G.H. Golub, C.F. Van Loan, Matrix Computations, second ed., Johns Hopkins University Press, Baltimore, 1989.
4. R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl. 197-198 (1994) 143-176.
5. J.J. Molitierno, M. Neumann, B.L. Shader, Tight bounds on the algebraic connectivity of a balanced binary tree, Electron, J. Linear Algebra 6 (2000) 62-71.
6. O. Rojo, The spectrum of the Laplacian matrix of a balanced binary tree, Linear Algebra Appl. 349 (2002) 203-219.
7. O. Rojo, M. Peña, A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree, Linear Algebra Appl. 362 (2003) 293-300.