Tight bounds on the algebraic connectivity of a balanced binary tree

DOI10.13001/1081-3810.1040zbMath0945.05040OpenAlexW1593025055MaRDI QIDQ4950388

Jason J. Molitierno, Michael Neumann, Bryan L. Shader

Publication date: 9 April 2000

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/120507

zbMATH Keywords

Laplacian matrixalgebraic connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Tight bounds on the algebraic connectivity of Bethe 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 ⋮ The spectrum of the Laplacian matrix of a balanced binary tree

This page was built for publication: Tight bounds on the algebraic connectivity of a balanced binary tree