Perron components and algebraic connectivity for weighted graphs
From MaRDI portal
Publication:4253151
DOI10.1080/03081089808818554zbMath0926.05026OpenAlexW2082897231MaRDI QIDQ4253151
Shaun M. Fallat, Stephen J. Kirkland
Publication date: 9 August 1999
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081089808818554
Related Items (21)
On algebraic connectivity of graphs with at most two points of articulation in each block ⋮ Principal submatrices of co-order one with the biggest Perron root ⋮ On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs ⋮ A note on limit points for algebraic connectivity ⋮ On graphs with algebraic connectivity equal to minimum edge density ⋮ On edge singularity and eigenvectors of mixed graphs ⋮ Algebraic connectivity of connected graphs with fixed number of pendant vertices ⋮ Minimizing algebraic connectivity over graphs made with some given blocks ⋮ The effect on the algebraic connectivity of a tree by grafting or collapsing of edges ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ The perturbed laplacian matrix of a graph ⋮ On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian ⋮ On eigenvectors of mixed graphs with exactly one nonsingular cycle ⋮ Perron value and moment of rooted trees ⋮ A Fiedler-like theory for the perturbed Laplacian ⋮ On operations in which graphs are appended to trees ⋮ A bound on the algebraic connectivity of a graph in terms of the number of cutpoints ⋮ Algebraic connectivity of k-connected graphs ⋮ Fiedler vector analysis for particular cases of connected graphs ⋮ Maximizing the distance between center, centroid and characteristic set of a tree ⋮ On the Perron roots of principal submatrices of co-order one of irreducible nonnegative matrices
Cites Work
- Eigenvalues, diameter, and mean distance in graphs
- Laplacian matrices of graphs: A survey
- Non-negative matrices and Markov chains.
- Characteristic vertices of weighted trees via perron values
- Matrix Analysis
- Algebraic connectivity of weighted trees under perturbation
- Constructions for type I trees with nonisomorphic Perron branches
- A spectral algorithm for envelope reduction of sparse matrices
- Ordering trees by algebraic connectivity
- Inequalities and equalities associated with the Campbell-Youla generalized inverse of the indefinite admittance matrix of resistive networks
This page was built for publication: Perron components and algebraic connectivity for weighted graphs
