Note on the product of the largest and the smallest eigenvalue of a graph

In this note, we use eigenvalue interlacing to derive an inequality between the maximum degree of a graph and its maximum and minimum adjacency eigenvalues. The case of equality is fully characterized.