What are some known criteria of excluding large independent sets (linear size) in k-regular graphs?

I know one criterion is that the smallest eigenvalue of the adjacency matrix shouldn't be too small ($|\lambda_n|=o(k)$). Are there any others? or, alternatively, what are the ways of approximating the smallest eigenvalue.