Loading...
Matching extension and distance spectral radius
Zhang,Yuke van Dam,Edwin R.
Zhang,Yuke
van Dam,Edwin R.
Abstract
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 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 k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.
Description
Publisher Copyright: © 2023 Elsevier Inc.
Date
2023-10-01
Journal Title
Journal ISSN
Volume Title
Publisher
Files
Research Projects
Organizational Units
Journal Issue
Keywords
Distance spectral radius, Extendability, Matching
Citation
Zhang, Y & van Dam, E R 2023, 'Matching extension and distance spectral radius', Linear Algebra and its Applications, vol. 674, pp. 244-255. https://doi.org/10.1016/j.laa.2023.06.002