On the Laplacian spectral ratio of connected graphs
From MaRDI portal
Publication:452899
DOI10.1016/j.aml.2011.09.071zbMath1248.05116OpenAlexW2085028691MaRDI QIDQ452899
Publication date: 18 September 2012
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.071
Related Items (4)
Some remarks on Laplacian eigenvalues of connected graphs ⋮ On Laplacian eigenvalues of connected graphs ⋮ Graph toughness from Laplacian eigenvalues ⋮ Inequalities for real number sequences with applications in spectral graph theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ordering of unicyclic graphs with the smallest algebraic connectivity
- Laplacian matrices of graphs: A survey
- Problems in algebraic combinatorics
- Interlacing eigenvalues and graphs
- Bounding the gap between extremal Laplacian eigenvalues of graphs
- Algebraic conditions for t-tough graphs
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- On sum of powers of the Laplacian eigenvalues of graphs
This page was built for publication: On the Laplacian spectral ratio of connected graphs