A graph is said to be k -factor -critical if deleting any of its k vertices results in a graph with a perfect matching. In this paper, we establish three sufficient conditions for a graph with given minimum degree to be k -factor -critical. These three sufficient conditions include the following: the size condition, Q -index condition and distance spectral radius cond...
