The
A graph is called k-extendable if each k-matching can be extended to a perfect matching. In this paper, we provide a sufficient condition in terms of the Aα-spectral radius for the k-extendability of a connected graph and characterize the corresponding extremal graphs. In addition, such an Aα-spectral condition of a connected balanced bipartite graph is also considered, and the corresponding extremal graphs are determined.
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2025-05-16
- DOI
- https://doi.org/10.1051/wujns/2025302118/pdf
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00