The Laplacian spread of quasi-tree graphs
From MaRDI portal
Publication:2431169
DOI10.1016/j.laa.2010.04.013zbMath1226.05173OpenAlexW2088488053MaRDI QIDQ2431169
Publication date: 11 April 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.013
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (9)
Some results on the Laplacian spread of a graph ⋮ The algebraic connectivity of a graph and its complement ⋮ Some results on the Laplacian spread conjecture ⋮ Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues ⋮ Algebraic connectivity of the second power of a graph ⋮ Minimal spread of integral circulant graphs ⋮ On the lower bound of the sum of the algebraic connectivity of a graph and its complement ⋮ The quasi-tree graph with maximum Laplacian spread ⋮ The Laplacian spread of line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spread of unicyclic graphs with given size of maximum matchings
- The Laplacian spread of unicyclic graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- A note on Laplacian graph eigenvalues
- An improved upper bound for Laplacian graph eigenvalues
- The Laplacian spread of tricyclic graphs
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- The spread of the spectrum of a graph
This page was built for publication: The Laplacian spread of quasi-tree graphs