The Laplacian spread of quasi-tree graphs
From MaRDI portal
Publication:2431169
DOI10.1016/j.laa.2010.04.013zbMath1226.05173MaRDI 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
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
Related Items
Algebraic connectivity of the second power of a graph, Minimal spread of integral circulant graphs, Some results on the Laplacian spread of a graph, Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues, The algebraic connectivity of a graph and its complement, On the lower bound of the sum of the algebraic connectivity of a graph and its complement, The Laplacian spread of line graphs, The quasi-tree graph with maximum Laplacian spread, Some results on the Laplacian spread conjecture
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