2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/143843Let G be a graph of n vertices and m edges, and let G has no cycles of length 4. We give upper bounds on the adjacency spectral radius of G in terms of n and m.Combinatorics05C50, 05C35The maximum spectral radius of C_4-free graphs of given order and sizetext