Algebraic connectivity of weighted trees under perturbation
From MaRDI portal
Publication:4366158
DOI10.1080/03081089708818498zbMATH Open0882.05091OpenAlexW2076442060MaRDI QIDQ4366158FDOQ4366158
Authors: M. Neumann, S. J. Kirkland 
Publication date: 11 March 1998
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089708818498
Recommendations
- Algebraic connectivity of trees with the maximum degree
- Deformation and algebraic connectivity of weighted trees
- Algebraic connectivity of trees with a pendant edge of infinite weight
- The algebraic connectivity of two trees connected by an edge of infinite weight
- On algebraic connectivity as a function of an edge weight
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Positive matrices and their generalizations; cones of matrices (15B48) Connectivity (05C40)
Cites Work
Cited In (39)
- Deformation and algebraic connectivity of weighted trees
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- Algebraic connectivity and degree sequences of trees
- Algebraic connectivity of trees with the maximum degree
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices
- Combinatorial Perron parameters for trees
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- The Laplacian spectra of graphs with a tree structure
- On the characteristic set, centroid, and centre for a tree
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- On the Laplacian spectral radius of weighted trees with a positive weight set
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- The perturbed laplacian matrix of a graph
- Augmenting the algebraic connectivity for certain families of graphs
- Old and new results on algebraic connectivity of graphs
- Maximizing the distance between center, centroid and characteristic set of a tree
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- Extreme values of the Fiedler vector on trees
- Perron components and algebraic connectivity for weighted graphs
- The algebraic connectivity of lollipop graphs
- On operations in which graphs are appended to trees
- Title not available (Why is that?)
- The algebraic connectivity of graphs under perturbation
- Coupling on weighted branching trees
- Minimizing algebraic connectivity over graphs made with some given blocks
- Algebraic connectivity of weighed graphs under shifting components
- On the Laplacian spectral radius of weighted trees with fixed diameter and weight set
- Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
- On algebraic connectivity of graphs with at most two points of articulation in each block
- On the Laplacian spectral radius of trees with fixed diameter
- Algebraic connectivity of trees with a pendant edge of infinite weight
- Combinatorial Perron values of trees and bottleneck matrices
- The algebraic connectivity of two trees connected by an edge of infinite weight
- A survey of automated conjectures in spectral graph theory
- Title not available (Why is that?)
- A minimax-condition for the characteristic center of a tree
This page was built for publication: Algebraic connectivity of weighted trees under perturbation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366158)
