Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions

Domingos M. Cardoso, Inês Serôdio Costa, Rui Duarte

Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduc…