The algebraic connectivity of graphs under perturbation
From MaRDI portal
Publication:989054
DOI10.1016/j.laa.2010.04.046zbMath1210.05078MaRDI QIDQ989054
Publication date: 27 August 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.046
15A15: Determinants, permanents, traces, other special matrix functions
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15B48: Positive matrices and their generalizations; cones of matrices
Related Items
Ordering trees by algebraic connectivity, The algebraic connectivity of lollipop graphs, A lower bound for the algebraic connectivity of a graph in terms of the domination number, Which cospectral graphs have same degree sequences, The smallest values of algebraic connectivity for trees, Ordering trees and graphs with few cycles by algebraic connectivity, An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications, The ordering of trees and connected graphs by algebraic connectivity, On a Poset of Trees II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Old and new results on algebraic connectivity of graphs
- Laplacian graph eigenvectors
- Minimizing algebraic connectivity over connected graphs with fixed girth
- On algebraic connectivity and spectral integral variations of graphs
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- Characteristic vertices of weighted trees via perron values
- Matrix Analysis
- Algebraic connectivity of weighted trees under perturbation
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of trees*
- Ordering trees by algebraic connectivity
