Tight bounds on the algebraic connectivity of a balanced binary tree

DOI10.13001/1081-3810.1040MaRDI QIDQ4950388zbMATH OpenOpenAlexFDO

Authors Jason J. Molitierno, M. 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, http://www.emis.de/journals/ELA/ela-articles/6.html#60, https://semanticscholar.org/paper/82ef358cd69f6e45a9fe8266080167191e876e61

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algebraic connectivityLaplacian matrix

Mathematics Subject Classification ID

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

Recommendations

• Tight bounds on the algebraic connectivity of Bethe trees
• The spectrum of the Laplacian matrix of a balanced binary tree
• A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• scientific article; zbMATH DE number 4208110

Cited in

(10)

• The spectrum of the Laplacian matrix of a balanced binary tree
• Balancing bounded treewidth circuits
• Maximizing algebraic connectivity for certain families of graphs
• Balancing Bounded Treewidth Circuits
• The spectrum of the Laplacian matrix of a balanced 2pary tree
• Intervals of balanced binary trees in the Tamari lattice
• 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

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

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