Spectral conditions for factor-criticality of graphs

A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$-factor-critical in terms of spectral radius and signless Laplacian spectral radius