Algebraic connectivity of weighted trees under perturbation
From MaRDI portal
Publication:4366158
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
Cites work
Cited in
(39)- Augmenting the algebraic connectivity for certain families of graphs
- On the Laplacian spectral radius of weighted trees with a positive weight set
- Old and new results on algebraic connectivity of graphs
- Minimizing algebraic connectivity over graphs made with some given blocks
- On the Laplacian spectral radius of trees with fixed diameter
- The algebraic connectivity of lollipop graphs
- A tight upper bound on the spectral radius of bottleneck matrices for graphs
- On operations in which graphs are appended to trees
- Perron components and algebraic connectivity for weighted graphs
- Algebraic connectivity of weighed graphs under shifting components
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- Maximizing the distance between center, centroid and characteristic set of a tree
- The perturbed laplacian matrix of a graph
- scientific article; zbMATH DE number 6000778 (Why is no real title available?)
- First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
- Algebraic connectivity of trees with a pendant edge of infinite weight
- Coupling on weighted branching trees
- A conjecture on the algebraic connectivity of connected graphs with fixed girth
- Combinatorial Perron values of trees and bottleneck matrices
- Trees with matrix weights: Laplacian matrix and characteristic-like vertices
- Strictly monotone sequences of lower and upper bounds on Perron values and their combinatorial applications
- Deformation and algebraic connectivity of weighted trees
- On the Laplacian spectral radius of weighted trees with fixed diameter and weight set
- On algebraic connectivity of graphs with at most two points of articulation in each block
- On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- Algebraic connectivity of trees with the maximum degree
- The Laplacian spectra of graphs with a tree structure
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- The algebraic connectivity of graphs under perturbation
- The algebraic connectivity of two trees connected by an edge of infinite weight
- A survey of automated conjectures in spectral graph theory
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- A minimax-condition for the characteristic center of a tree
- Combinatorial Perron parameters for trees
- On the characteristic set, centroid, and centre for a tree
- Algebraic connectivity and degree sequences of trees
- 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
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)