On algebraic connectivity of graphs with at most two points of articulation in each block
From MaRDI portal
Publication:2895688
DOI10.1080/03081087.2011.603727zbMath1244.05139OpenAlexW2033536332MaRDI QIDQ2895688
Arbind Kumar Lal, Ravindra B. Bapat, Sukanta Pati
Publication date: 4 July 2012
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2011.603727
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Related Items (6)
Extremizing first eigenvalue of 3-colored digraphs made with given blocks ⋮ Null decomposition of unicyclic graphs ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ Integer Laplacian eigenvalues of chordal graphs ⋮ Block-indifference graphs: characterization, structural and spectral properties ⋮ Algebraic connectivity of k-connected graphs
Cites Work
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Laplacian matrices of graphs: A survey
- Minimizing algebraic connectivity over connected graphs with fixed girth
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The ordering of trees and connected graphs by algebraic connectivity
- The perturbed laplacian matrix of a graph
- Characteristic vertices of weighted trees via perron values
- Perron components and algebraic connectivity for weighted graphs
- Algebraic connectivity of weighted trees under perturbation
This page was built for publication: On algebraic connectivity of graphs with at most two points of articulation in each block