Constructions for type I trees with nonisomorphic Perron branches
Czechoslovak Mathematical Journal (1999)
- Volume: 49, Issue: 3, page 617-632
- ISSN: 0011-4642
Access Full Article
top
Abstract
topHow to cite
topKirkland, Stephen J.. "Constructions for type I trees with nonisomorphic Perron branches." Czechoslovak Mathematical Journal 49.3 (1999): 617-632. <http://eudml.org/doc/30510>.
@article{Kirkland1999,
abstract = {A tree is classified as being type I provided that there are two or more Perron branches at its characteristic vertex. The question arises as to how one might construct such a tree in which the Perron branches at the characteristic vertex are not isomorphic. Motivated by an example of Grone and Merris, we produce a large class of such trees, and show how to construct others from them. We also investigate some of the properties of a subclass of these trees. Throughout, we exploit connections between characteristic vertices, algebraic connectivity, and Perron values of certain positive matrices associated with the tree.},
author = {Kirkland, Stephen J.},
journal = {Czechoslovak Mathematical Journal},
keywords = {weighted graph; Laplacian matrix; algebraic connectivity},
language = {eng},
number = {3},
pages = {617-632},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Constructions for type I trees with nonisomorphic Perron branches},
url = {http://eudml.org/doc/30510},
volume = {49},
year = {1999},
}
TY - JOUR
AU - Kirkland, Stephen J.
TI - Constructions for type I trees with nonisomorphic Perron branches
JO - Czechoslovak Mathematical Journal
PY - 1999
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 49
IS - 3
SP - 617
EP - 632
AB - A tree is classified as being type I provided that there are two or more Perron branches at its characteristic vertex. The question arises as to how one might construct such a tree in which the Perron branches at the characteristic vertex are not isomorphic. Motivated by an example of Grone and Merris, we produce a large class of such trees, and show how to construct others from them. We also investigate some of the properties of a subclass of these trees. Throughout, we exploit connections between characteristic vertices, algebraic connectivity, and Perron values of certain positive matrices associated with the tree.
LA - eng
KW - weighted graph; Laplacian matrix; algebraic connectivity
UR - http://eudml.org/doc/30510
ER -
References
top- Algebraic connectivity of graphs, Czechoslovak Math. J. 23 (98) (1973), 298–305. (1973) Zbl0265.05119MR0318007
- A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak Math. J. 25 (100) (1975), 619–633. (1975) MR0387321
- Algebraic connectivity of trees, Czechoslovak Math. J. 37 (112) (1987), 660–670. (1987) MR0913997
- 10.1080/03081089608818448, Linear and Multilinear Algebra 40 (1996), 311–325. (1996) MR1384650DOI10.1080/03081089608818448
- 10.1080/03081088708817827, Linear and Multilinear Algebra 22 (1987), 115–131. (1987) Zbl0636.05021MR0936566DOI10.1080/03081088708817827
- Laplacian matrices of graphs: a survey, Linear Algebra Appl. 197/198 (1994), 143–176. (1994) Zbl0802.05053MR1275613
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.