2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/102035We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.Corrections were made in Theorems 5 and 11 (the new numbers are different), following a remark of professor Yaoping HouCombinatorics15A42, 05C50text