Computing tight upper bounds on the algebraic connectivity of certain graphs

DOI10.1016/j.laa.2008.08.018zbMath1213.05159OpenAlexW2046071770MaRDI QIDQ958040

Oscar Rojo

Publication date: 2 December 2008

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

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

zbMATH Keywords

Laplacian matrixalgebraic connectivitygeneralized Bethe treesBethe trees

Mathematics Subject Classification ID

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

Related Items

Spectra of copies of a generalized Bethe tree attached to any graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spectra of some trees and bounds for the largest eigenvalue of any tree
• On the spectra of certain rooted trees
• Tight bounds on the algebraic connectivity of Bethe trees
• The spectra of a graph obtained from copies of a generalized Bethe tree
• Old and new results on algebraic connectivity of graphs
• Spectra of weighted generalized Bethe trees joined at the root
• Eigenvalues, diameter, and mean distance in graphs
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• Theory of monomer-dimer systems
• The Laplacian Spectrum of a Graph
• Tight bounds on the algebraic connectivity of a balanced binary tree