An upper bound on algebraic connectivity of graphs with many cutpoints

DOI10.13001/1081-3810.1063zbMath0984.05057OpenAlexW2161640119MaRDI QIDQ2723257

Stephen J. Kirkland

Publication date: 9 July 2001

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121762

zbMATH Keywords

Laplacian matrixalgebraic connectivitycutpoint

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (8)

Upper bounds on algebraic connectivity via convex optimization ⋮ On the stability of the computation of the stationary probabilities of Markov chains using Perron complements ⋮ Old and new results on algebraic connectivity of graphs ⋮ Ordering trees with algebraic connectivity and diameter ⋮ Unnamed Item ⋮ Conjugate Laplacian matrices of a graph ⋮ A survey of automated conjectures in spectral graph theory ⋮ Perron value and moment of rooted trees

This page was built for publication: An upper bound on algebraic connectivity of graphs with many cutpoints