A bound on the algebraic connectivity of a graph in terms of the number of outpoints

Linear and Multilinear Algebra

Volumn 47, Issue 1, 2000, Pages 93-103

  Kirkland, Steve ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Algebraic connectivity; Cutpoint; Laplacian matrix; Perron value

Indexed keywords

EID: 0042066025     PISSN: 03081087     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Berman, A. and Plemmons, R. J. (1994). Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia.
2. Fallat, S. and Kirkland, S. (1998). Extremizing algebraic connectivity subject to graph theoretic constraints, Electronic Journal of Linear Algebra, 3, 48-74.
3. Fiedler, M. (1973). Algebraic connectivity of graphs, Czechoslovak Mathematical Journal, 23, 298-305.
4. Fiedler, M. (1975). A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak Mathematical Journal, 25, 607-618.
5. Grone, R. and Merris, R. (1987). Algebraic connectivity of trees, Czechoslovak Mathematical Journal, 37, 660-670.
6. Kirkland, S. and Fallal, S. (1998). Perron components and algebraic connectivity for weighted graphs, Linear and Multilinear Algebra, 44, 131-148.
7. Merris, R. (1987). Characteristic vertices of tress, Linear and Multilinear Algebra, 22, 115-131.
8. Merris, R. (1994). Laplacian matrices of graphs: a survey, Linear Algebra Appl., 197/198, 143-176.