2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/72808We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.4 pagesCombinatorics05C35The smallest eigenvalue of K_p-free graphstext