The <i>A<sub>α</sub></i>-Spectral Radius and <i>k</i>-Extendability in Graphs
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.
Authors
- Fei Wen (ORCID: https://orcid.org/0000-0001-7929-5005)
- Jing Ha
Institutions
- Lanzhou Jiaotong University (CN)
Publication Details
- Journal
- Wuhan University Journal of Natural Sciences
- Published
- 2025-04-01
- DOI
- https://doi.org/10.1051/wujns/2025302118
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Natural Science Foundation of Gansu Province