Bounds on the distance signless Laplacian spectral radius in terms of clique number
Authors:
- 23 October 2014
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 63 (9) , 1750-1759
Abstract
The distance signless Laplacian spectral radius of a connected graph , denoted by , is the maximal eigenvalue of the distance signless Laplacian matrix of . In this paper, we find a sharp lower bound as well as a sharp upper bound of in terms of the clique number. Furthermore, both extremal graphs are uniquely determined.Keywords
Funding Information
- National Natural Science Foundation of China (11371137, 11401211)
This publication has 11 references indexed in Scilit:
- On the distance spectrum of graphsLinear Algebra and its Applications, 2013
- Two Laplacians for the distance matrix of a graphLinear Algebra and its Applications, 2013
- Sharp bounds for the signless Laplacian spectral radius in terms of clique numberLinear Algebra and its Applications, 2013
- Distance spectral radius of digraphs with given connectivityDiscrete Mathematics, 2012
- Connectivity and minimal distance spectral radius of graphsLinear and Multilinear Algebra, 2011
- Distance spectral radius of trees with given matching numberDiscrete Applied Mathematics, 2010
- Distance spectral radius of trees with fixed maximum degreeThe Electronic Journal of Linear Algebra, 2010
- Sharp bounds on the distance spectral radius and the distance energy of graphsLinear Algebra and its Applications, 2009
- On the largest eigenvalue of the distance matrix of a connected graphChemical Physics Letters, 2007
- Mass Transfer Coefficients and Correlation for CO2 Absorption into 2-Amino-2-methyl-1-propanol (AMP) Using Structured PackingIndustrial & Engineering Chemistry Research, 1998