On the least eigenvalue of cacti with pendant vertices

A connected graph is a cactus if any two of its cycles share at most one common vertex. We determine the unique graph with minimum least eigenvalue among the cacti with fixed numbers of vertices and pendant vertices.