Spectral radius and k-factor-critical graphs

Sizhong Zhou, Zhiren Sun, Yuli Zhang

For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove sp…