  We prove an upper bound for the independence number of a graph in terms of
the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound
is a refinement of a well-known Hoffman-type bound.
