Upper bounds for the second largest eigenvalue of symmetric nonnegative matrices

The paper suggests upper bounds on the second largest eigenvalue and the sum of two largest eigenvalues of symmetric nonnegative matrices and graphs. Conditions necessary and sufficient for some of the bounds to be attained are established. Special attention is paid to the subclass of matrices with zero diagonal entries and with off-diagonal entries not exceeding unity, which obviously contains the adjacency matrices of undirected graphs.