2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/70599A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.Combinatorics05E30text