2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/75480Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).Combinatorics15A42, 05C50text