Laplacian spread of graphs: lower bounds and relations with invariant parameters
From MaRDI portal
Publication:498342
DOI10.1016/j.laa.2015.08.027zbMath1321.05149OpenAlexW1840890977MaRDI QIDQ498342
María Robbiano, Domingos Moreira Cardoso, Jonnathan Rodríguez Z., Enide Andrade
Publication date: 28 September 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.08.027
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (6)
Some results on the Laplacian spread of a graph ⋮ New lower bounds for the Randić spread ⋮ Minimal spread of integral circulant graphs ⋮ New bounds for the signless Laplacian spread ⋮ Upper bounds on the Laplacian spread of graphs ⋮ The quasi-tree graph with maximum Laplacian spread
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the spread of a matrix
- Eigenvalues, diameter, and mean distance in graphs
- Laplacian matrices of graphs: A survey
- Bounds for the spectrum of normal matrices
- Lower bounds for the spread of a Hermitian matrix
- Characterizations and lower bounds for the spread of a normal matrix
- Interlacing eigenvalues and graphs
- Bounding the gap between extremal Laplacian eigenvalues of graphs
- Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
- The Laplacian spread of graphs
- The spread of a matrix
- Eigenvalues of the Laplacian of a graph∗
- On the spread of a hermitian matrix and a conjecture of thompson
- On graphs with equal algebraic and vertex connectivity
This page was built for publication: Laplacian spread of graphs: lower bounds and relations with invariant parameters