The algebraic connectivity of graphs under perturbation
DOI10.1016/J.LAA.2010.04.046zbMATH Open1210.05078OpenAlexW2050710833MaRDI QIDQ989054FDOQ989054
Authors: Jiming Guo 
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Determinants, permanents, traces, other special matrix functions (15A15)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Laplacian graph eigenvectors
- Minimizing algebraic connectivity over connected graphs with fixed girth
- Title not available (Why is that?)
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Old and new results on algebraic connectivity of graphs
- Title not available (Why is that?)
- Algebraic connectivity and the characteristic set of a graph
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Characteristic vertices of trees*
- On algebraic connectivity and spectral integral variations of graphs
- Characteristic vertices of weighted trees via perron values
- Algebraic connectivity of weighted trees under perturbation
- Ordering trees by algebraic connectivity
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Cited In (17)
- On a poset of trees. II
- The ordering of trees and connected graphs by algebraic connectivity
- ON THE ALGEBRAIC EMBEDDABILITY IN THE CLASS OF FUNCTIONS POSSESSING CONNECTED GRAPHS
- An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications
- Old and new results on algebraic connectivity of graphs
- On the relationship between shortlex order and \(A_\alpha \)-spectral radii of graphs with starlike branch tree
- Which cospectral graphs have same degree sequences
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Algebraic connectivity on a subclass of caterpillars
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- The algebraic connectivity of lollipop graphs
- Ordering trees by algebraic connectivity
- Conjectures on index and algebraic connectivity of graphs
- The smallest values of algebraic connectivity for trees
- Ordering trees and graphs with few cycles by algebraic connectivity
- Algebraic connectivity and disjoint vertex subsets of graphs
- Algebraic connectivity for subclasses of caterpillars
This page was built for publication: The algebraic connectivity of graphs under perturbation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989054)
