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 using Tutte-type Hall-type structural characterizations. Concretely, we sufficient condition in terms radius distance matrix completely characterize corresponding extremal graphs. similar result obtained
