An upper bound on algebraic connectivity of graphs with many cutpoints

Electronic Journal of Linear Algebra

Volumn 8, Issue , 2001, Pages 94-109

  Kirkland, S ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Algebraic connectivity; Cutpoint; Laplacian matrix

Indexed keywords

EID: 3042616223     PISSN: 10813810     EISSN: None     Source Type: Journal    
DOI: 10.13001/1081-3810.1063     Document Type: Article

References (9)

1. R. Bapat, S. Kirkland, and S. Pati. The perturbed Laplacian matrix of a graph. Linear and Multilinear Algebra, to appear.
2. R. Bapat and S. Pati. Algebraic connectivity and the characteristic set of a graph. Linear and Multilinear Algebra, 45:247-273, 1998.
3. A. Berman and R. Plemmons. Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia, 1994.
4. S. Fallat and S. Kirkland. Extremizing algebraic connectivity subject to graph theoretic constraints. Electronic Journal of Linear Algebra, 3:48-74, 1998.
5. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298-305, 1973.
6. R. Horn and C.R. Johnson. Matrix Analysis, Cambridge University Press, Cambridge, 1985.
7. S. Kirkland. A bound on the algebraic connectivity of a graph in terms of the number of cutpoints. Linear and Multilinear Algebra, 47:93-103, 2000.
8. S. Kirkland and S. Fallat. Perron components and algebraic connectivity for weighted graphs. Linear and Multilinear Algebra, 44:131-148, 1998.
9. R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra and its Applications, 197/198:143-176, 1994.