2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/115406We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.Some calculation errors in the first version are correctedCombinatoricsCommutative Algebra05C50text