摘要
Let G be a simple connected graph of order n >= 2 with maximum degree Delta and minimum degree delta, and eigenvalues lambda(1) >= lambda(2) >= ... >= lambda(n). It is shown that the independence number of G can be bounded from above by Delta-delta-lambda(n)/Delta n and lambda(1)-lambda(n)+Delta-2 delta/lambda(1)-lambda(n)+Delta-delta n.
- 出版日期2014-9-10
- 单位同济大学