Lower bounds for the eigenvalues of Laplacian matrices
From MaRDI portal
Publication:1587270
DOI10.1016/S0024-3795(99)00264-5zbMath0958.15014MaRDI QIDQ1587270
Abraham Berman, Xiao Dong Zhang
Publication date: 18 April 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (18)
Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities ⋮ Admissible output consensualization control for singular multi-agent systems with time delays ⋮ A note on improvement on bounds for nonmaximal eigenvalues of symmetric positive matrices ⋮ Leader-follower guaranteed-cost consensualization for high-order linear swarm systems with switching topologies ⋮ Old and new results on algebraic connectivity of graphs ⋮ Formation tracking for interconnected networks with interaction silence and minimum total energy restriction ⋮ The clustering coefficient and the diameter of small-world networks ⋮ Formation tracking for high-order time-invariant swarm systems with limited energy and fixed topologies ⋮ Limited-budget formation control for high-order linear swarm systems with fix topologies ⋮ Guaranteed cost formation tracking control for swarm systems with intermittent communications ⋮ A survey of automated conjectures in spectral graph theory ⋮ On the Laplacian spectral radius of weighted trees with a positive weight set ⋮ Bounds on the index of the signless Laplacian of a graph ⋮ Improving bounds for nonmaximal eigenvalues of positive matrices ⋮ On the Laplacian spectral radius of weighted trees with fixed diameter and weight set ⋮ Guaranteed-Cost Consensus Control For High-Order Linear Swarm Systems ⋮ Mixing Time of Random Walk on Poisson Geometry Small World ⋮ Consensus and synchronization problems on small-world networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Eigenvalues and expanders
- Lower bounds for the first eigenvalue of certain M-matrices associated with graphs
- Laplacian matrices of graphs: A survey
- Isoperimetric numbers of graphs
- Inequalities: theory of majorization and its applications
This page was built for publication: Lower bounds for the eigenvalues of Laplacian matrices
