A graph is called [see formula in PDF]-extendable if each [see formula in PDF]-matching can be extended to a perfect matching. In this paper, we provide a sufficient condition in terms of the [see formula in PDF]-spectral radius for the [see formula in PDF]-extendability of a connected graph and characterize the corresponding extremal graphs. In addition, such an [see formula in PDF]-spectral condition of a connected balanced bipartite graph is also considered, and the corresponding extremal graphs are determined.
No takes yet. Share an insight, caveat, or question.
Ha et al. (2025) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: