Tight bounds on the algebraic connectivity of Bethe trees

Linear Algebra and Its Applications

Volumn 418, Issue 2-3, 2006, Pages 840-853

  Rojo, Oscar ^a   Medina, Luis ^a  

^a UNIVERSIDAD CATÓLICA DEL NORTE   (Chile)

Author keywords

Algebraic connectivity; Bethe trees; Laplacian matrix; Sherman Morrison formula

Indexed keywords

LAPLACE TRANSFORMS; MATRIX ALGEBRA;

ALGEBRAIC CONNECTIVITY; BETHE TREES; LAPLACIAN MATRIX; SHERMAN MORRISON FORMULA;

TREES (MATHEMATICS);

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

References (8)

1. Dahlquist G., and Björck Å. Numerical Methods (1974), Prentice-Hall, Inc., Englewood Cliffs, NJ
2. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 (1973) 298-305
3. Golub G.H., and Van Loan C.F. Matrix Computations. second ed. (1989), Johns Hopkins University Press, Baltimore
4. Heilmann O.J., and Lieb E.H. Theory of monomer-dimer systems. Comm. Math. Phys. 25 (1972) 190-232
5. Horn R.A., and Johnson C.R. Matrix Analysis (1991), Cambridge University Press, Cambridge
6. Molitierno J.J., Neumann M., and Shader B.S. Tight bounds on the algebraic connectivity of a balanced binary tree. Electron. J. Linear Algebra 6 March (2000) 62-71
7. Rojo O., and Soto R. The spectra of the adjacency matrix and Laplacian matrix for some balanced trees. Linear Algebra Appl. 403 (2005) 97-117
8. Rojo O. On the spectra of certain rooted trees. Linear Algebra Appl. 414 (2006) 218-243