2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/112634We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.Combinatorics05C50text