The question as stated is false via considering complete bipartite graphs $K_{n,n}$ whose smallest (and only) positive eigenvalue is $n$.  However, based on your notation you perhaps meant to ask for the smallest non-negative value, which is less obvious to me.