Tight bounds on the algebraic connectivity of a balanced binary tree.
Molitierno, Jason J.; Neumann, Michael; Shader, Bryan L.
ELA. The Electronic Journal of Linear Algebra [electronic only] (2000)
- Volume: 6, page 62-71
- ISSN: 1081-3810
Access Full Article
topHow to cite
topMolitierno, Jason J., Neumann, Michael, and Shader, Bryan L.. "Tight bounds on the algebraic connectivity of a balanced binary tree.." ELA. The Electronic Journal of Linear Algebra [electronic only] 6 (2000): 62-71. <http://eudml.org/doc/120507>.
@article{Molitierno2000,
author = {Molitierno, Jason J., Neumann, Michael, Shader, Bryan L.},
journal = {ELA. The Electronic Journal of Linear Algebra [electronic only]},
keywords = {Laplacian matrix; algebraic connectivity},
language = {eng},
pages = {62-71},
publisher = {ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy},
title = {Tight bounds on the algebraic connectivity of a balanced binary tree.},
url = {http://eudml.org/doc/120507},
volume = {6},
year = {2000},
}
TY - JOUR
AU - Molitierno, Jason J.
AU - Neumann, Michael
AU - Shader, Bryan L.
TI - Tight bounds on the algebraic connectivity of a balanced binary tree.
JO - ELA. The Electronic Journal of Linear Algebra [electronic only]
PY - 2000
PB - ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy
VL - 6
SP - 62
EP - 71
LA - eng
KW - Laplacian matrix; algebraic connectivity
UR - http://eudml.org/doc/120507
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.