Spectral condition for $k$-factor-criticality in $t$-connected graphs

A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $\mathrm{\mid }S\mathrm{\mid }=k$. A connected graph $G$ is called $t$-connected if it has more than $t$ vertices and remains connected whenever fewer than $t$ vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for $k$-factor-criticality in $t$-connected graphs.