Tight bounds on the algebraic connectivity of Bethe trees

DOI10.1016/j.laa.2006.03.016zbMath1107.05026OpenAlexW2078438273MaRDI QIDQ855576

N. E. Zubov

Publication date: 7 December 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.03.016

zbMATH Keywords

Laplacian matrixSherman-Morrison formula

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

On the spectrum of finite, rooted homogeneous trees ⋮ Old and new results on algebraic connectivity of graphs ⋮ Computing tight upper bounds on the algebraic connectivity of certain graphs ⋮ A survey of automated conjectures in spectral graph theory ⋮ Maximizing algebraic connectivity for certain families of graphs ⋮ Line graph of combinations of generalized Bethe trees: Eigenvalues and energy ⋮ Perron value and moment of rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectra of certain rooted trees
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• Theory of monomer-dimer systems
• Tight bounds on the algebraic connectivity of a balanced binary tree

This page was built for publication: Tight bounds on the algebraic connectivity of Bethe trees