Algebraic connectivity of trees with a pendant edge of infinite weight.
ELA. The Electronic Journal of Linear Algebra [electronic only] (2005)
- Volume: 13, page 175-186
- ISSN: 1081-3810
Access Full Article
top
How to cite
topBerman, A., and Förster, K.-H.. "Algebraic connectivity of trees with a pendant edge of infinite weight.." ELA. The Electronic Journal of Linear Algebra [electronic only] 13 (2005): 175-186. <http://eudml.org/doc/126967>.
@article{Berman2005,
author = {Berman, A., Förster, K.-H.},
journal = {ELA. The Electronic Journal of Linear Algebra [electronic only]},
keywords = {weighted graphs; Laplacian matrix},
language = {eng},
pages = {175-186},
publisher = {ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy},
title = {Algebraic connectivity of trees with a pendant edge of infinite weight.},
url = {http://eudml.org/doc/126967},
volume = {13},
year = {2005},
}
TY - JOUR
AU - Berman, A.
AU - Förster, K.-H.
TI - Algebraic connectivity of trees with a pendant edge of infinite weight.
JO - ELA. The Electronic Journal of Linear Algebra [electronic only]
PY - 2005
PB - ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy
VL - 13
SP - 175
EP - 186
LA - eng
KW - weighted graphs; Laplacian matrix
UR - http://eudml.org/doc/126967
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.