Minimizing algebraic connectivity over graphs made with some given blocks

DOI10.1080/03081087.2018.1438984zbMath1411.05166OpenAlexW2792169227MaRDI QIDQ4632255

Kuldeep Sarma, Debajit Kalita

Publication date: 29 April 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2018.1438984

zbMATH Keywords

blockLaplacian matrixalgebraic connectivityFiedler vectorrestricted graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic connectivity of connected graphs with fixed number of pendant vertices
• A conjecture on the algebraic connectivity of connected graphs with fixed girth
• Minimizing algebraic connectivity over connected graphs with fixed girth
• On algebraic connectivity of graphs with at most two points of articulation in each block
• The minimum algebraic connectivity of caterpillar unicyclic graphs
• Matrix Analysis
• Perron components and algebraic connectivity for weighted graphs
• Algebraic connectivity of weighted trees under perturbation
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Algebraic connectivity and the characteristic set of a graph