The signless Laplacian spectral radius of graphs with a prescribed number of edges
Authors:
- Mingqing ZhaiMZMingqing Zhai
- Jie XueJXJie Xue
- Zhenzhen LouZLZhenzhen Lou
- 1 October 2020
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 603, 154-165
Abstract
No abstract availableKeywords
Funding Information
- China Postdoctoral Science Foundation
- National Natural Science Foundation of China
This publication has 24 references indexed in Scilit:
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphsDiscrete Mathematics, 2012
- Signless Laplacian spectral radii of graphs with given chromatic numberLinear Algebra and its Applications, 2011
- On the two largest -eigenvalues of graphsDiscrete Mathematics, 2010
- Bounds on the index of the signless Laplacian of a graphDiscrete Applied Mathematics, 2010
- Towards a spectral theory of graphs based on the signless Laplacian, IIIApplicable Analysis and Discrete Mathematics, 2010
- The signless Laplacian spectral radius of graphs with given degree sequencesDiscrete Applied Mathematics, 2009
- Cliques and the spectral radiusJournal of Combinatorial Theory, Series B, 2007
- On the spectral radius of (0,1)-matricesLinear Algebra and its Applications, 1985
- Lower bounds for the clique and the chromatic numbers of a graphDiscrete Applied Mathematics, 1983
- The Eigenvalues of a Graph and Its Chromatic NumberJournal of the London Mathematical Society, 1967