On the sum of k largest eigenvalues of graphs and symmetric matrices

Let k be a positive integer and let G be a graph of order n⩾k. It is proved that the sum of k largest eigenvalues of G is at most . This bound is shown to be best possible in the sense that for every k there exist graphs whose sum is . A generalization to arbitrary symmetric matrices is given.