The signless Laplacian spectral radius of graphs with given degree sequences
Author:
- Xiao-Dong ZhangXZXiao-Dong Zhang
- 1 July 2009
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (13) , 2928-2937
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bounds on the index of the signless Laplacian of a graphDiscrete Applied Mathematics, 2010
- The Laplacian spectral radii of trees with degree sequencesDiscrete Mathematics, 2008
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given orderLinear and Multilinear Algebra, 2008
- Signless Laplacians of finite graphsLinear Algebra and its Applications, 2007
- Minimizing the Laplacian spectral radius of trees with given matching numberLinear and Multilinear Algebra, 2007
- Improved bounds for the largest eigenvalue of treesLinear Algebra and its Applications, 2005
- A new upper bound for eigenvalues of the laplacian matrix of a graphLinear Algebra and its Applications, 1997
- A characterization of the smallest eigenvalue of a graphJournal of Graph Theory, 1994
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- The class A(R, S) of (0, 1)-matricesDiscrete Mathematics, 1982