Sharp bounds for the signless Laplacian spectral radius in terms of clique number
Authors:
- Bian HeBHBian He
- Ya-Lei JinYJYa-Lei Jin
- Xiao-Dong ZhangXZXiao-Dong Zhang
- 1 May 2013
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 438 (10) , 3851-3861
Abstract
No abstract availableAll Related Versions
This publication has 17 references indexed in Scilit:
- Bounds and conjectures for the signless Laplacian index of graphsLinear Algebra and its Applications, 2010
- Towards a spectral theory of graphs based on the signless Laplacian, IILinear Algebra and its Applications, 2010
- The spectral radius of graphs without paths and cycles of specified lengthLinear Algebra and its Applications, 2010
- A contribution to the Zarankiewicz problemLinear Algebra and its Applications, 2010
- Towards a spectral theory of graphs based on the signless Laplacian, IIIApplicable Analysis and Discrete Mathematics, 2010
- A Spectral Erdős–Stone–Bollobás TheoremCombinatorics, Probability and Computing, 2009
- Towards a spectral theory of graphs based on the signless Laplacian, I2009
- The maximum clique and the signless Laplacian eigenvaluesCzechoslovak Mathematical Journal, 2008
- Bounds on graph eigenvalues IILinear Algebra and its Applications, 2007
- A characterization of the smallest eigenvalue of a graphJournal of Graph Theory, 1994