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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The

Springer Link (Chiba Institute of Technology)
Graph theory and applications
article

The

article en

Abstract

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.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 16%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.