Matching extension and distance spectral radius

Yuke Zhang, Edwin R. van Dam

A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs us…