Article ID Journal Published Year Pages File Type
421169 Discrete Applied Mathematics 2014 4 Pages PDF
Abstract

Let GG be a simple connected graph of order n≥2n≥2 with maximum degree ΔΔ and minimum degree δδ, and eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn. It is shown that the independence number of GG can be bounded from above by Δ−δ−λnΔn and λ1−λn+Δ−2δλ1−λn+Δ−δn.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,