Sharp upper bounds for the Laplacian spectral radius of graphs
From MaRDI portal
Publication:474024
zbMATH Open1299.05243MaRDI QIDQ474024FDOQ474024
Authors: Houqing Zhou, Y. Z. Xu
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Recommendations
Cited In (11)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sharp upper bound of the spectral radius of graphs
- Eigenvalue bounds of the Kirchhoff Laplacian
- Sharp bounds on distance spectral radius of graphs
- Sharpness of KKL on Schreier graphs
- The spectral radius for a class of double-star-like tree systems with maximal degree 4
- On the sharpness of spectral estimates for graph Laplacians
- Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs
- Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs
- Sharp upper bounds on the spectral radius of graphs
This page was built for publication: Sharp upper bounds for the Laplacian spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474024)