A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
From MaRDI portal
Publication:4485090
DOI10.1080/03081080008818634zbMath0947.05052OpenAlexW1968625658MaRDI QIDQ4485090
Publication date: 5 November 2000
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080008818634
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (22)
A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ The Laplacian spread of unicyclic graphs ⋮ Upper bounds on algebraic connectivity via convex optimization ⋮ Lower bounds of the Laplacian spectrum of graphs based on diameter ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ Old and new results on algebraic connectivity of graphs ⋮ On the distance Laplacian spectra of graphs ⋮ The Laplacian spread of quasi-tree graphs ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications ⋮ Ordering trees with algebraic connectivity and diameter ⋮ The number of spanning trees of a graph ⋮ Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality ⋮ Bounds of Laplacian spectrum of graphs based on the domination number ⋮ Unnamed Item ⋮ Some results on the Laplacian spectrum ⋮ The algebraic connectivity of graphs under perturbation ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ Perron value and moment of rooted trees ⋮ On the Laplacian integral tricyclic graphs ⋮ A characterization of spectral integral variation in two places for Laplacian matrices ⋮ Block-indifference graphs: characterization, structural and spectral properties
Cites Work
This page was built for publication: A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
