摘要
Let G be a simple connected graph of order n with degree sequence d(1), d(2), ... , d(n) in non-increasing order. The signless Laplacian spectral radius rho(Q(G)) of G is the largest eigenvalue of its signless Laplacian matrix Q (G). In this paper, we give a sharp upper bound on the signless Laplacian spectral radius rho(Q(G)) in terms of d(i), which improves and generalizes some known results.
- 出版日期2013-10-15
- 单位浙江师范大学