Tight bounds on the algebraic connectivity of Bethe trees

DOI10.1016/J.LAA.2006.03.016zbMATH Open1107.05026OpenAlexW2078438273MaRDI QIDQ855576FDOQ855576

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

Recommendations

• Computing tight upper bounds on the algebraic connectivity of certain graphs
• Tight bounds on the algebraic connectivity of a balanced binary tree
• Spectra of copies of a generalized Bethe tree attached to any graph
• Ordering trees by algebraic connectivity
• Spectra of weighted generalized Bethe trees joined at the root

zbMATH Keywords

Laplacian matrixSherman-Morrison formula

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of monomer-dimer systems
• Title not available (Why is that?)
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• On the spectra of certain rooted trees
• Tight bounds on the algebraic connectivity of a balanced binary tree

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855576)