Matching extension and distance spectral radius
Combinatorics
2023-03-31 v1
Abstract
A graph is called -extendable if each -matching can be extended to a perfect matching. We give spectral conditions for the -extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Concretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the -extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.
Cite
@article{arxiv.2303.17284,
title = {Matching extension and distance spectral radius},
author = {Yuke Zhang and Edwin R. van Dam},
journal= {arXiv preprint arXiv:2303.17284},
year = {2023}
}