Perron components and algebraic connectivity for weighted graphs
From MaRDI portal
Publication:4253151
Recommendations
Cites work
- A spectral algorithm for envelope reduction of sparse matrices
- Algebraic connectivity of weighted trees under perturbation
- Characteristic vertices of weighted trees via perron values
- Constructions for type I trees with nonisomorphic Perron branches
- Eigenvalues, diameter, and mean distance in graphs
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
- Laplacian matrices of graphs: A survey
- Matrix Analysis
- Non-negative matrices and Markov chains.
- Ordering trees by algebraic connectivity
Cited in
(29)- Ordering trees and graphs with few cycles by algebraic connectivity
- Minimizing algebraic connectivity over graphs made with some given blocks
- Perron value and moment of rooted trees
- On algebraic connectivity and spectral integral variations of graphs
- On edge singularity and eigenvectors of mixed graphs
- On operations in which graphs are appended to trees
- On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
- Algebraic connectivity of weighed graphs under shifting components
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- Principal submatrices of co-order one with the biggest Perron root
- Maximizing the distance between center, centroid and characteristic set of a tree
- The perturbed laplacian matrix of a graph
- Algebraic connectivity of \(k\)-connected graphs.
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- On the Perron roots of principal submatrices of co-order one of irreducible nonnegative matrices
- On algebraic connectivity as a function of an edge weight
- A note on limit points for algebraic connectivity
- On eigenvectors of mixed graphs with exactly one nonsingular cycle
- 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 Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
- The effect on the algebraic connectivity of a tree by grafting or collapsing of edges
- Algebraic connectivity and the characteristic set of a graph
- A Fiedler-like theory for the perturbed Laplacian.
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Effects on the algebraic connectivity of weighted graphs under edge rotations
- Extreme values of the Fiedler vector on trees
- Fiedler vector analysis for particular cases of connected graphs
- On graphs with algebraic connectivity equal to minimum edge density
This page was built for publication: Perron components and algebraic connectivity for weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253151)
