Tight estimates for eigenvalues of regular graphs

Abstract

It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at least 2√d - 1 cos( π/2k ). A similar result has been proved by Friedman using more sophisticated tools.