2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/123132We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.The second version corrects a stupid mistakeCombinatorics05C50The Moore bound for Spectral Radiustext