Perfect matchings and $A_{\alpha}$-spectral radius in 1-binding graphs
Combinatorics
2026-04-28 v1
Abstract
Let be a graph with vertex set and edge set . For , we use and to denote the -matrix and the -spectral radius of , respectively. The binding number of is defined by . If , then is called 1-binding. A perfect matching in is a set of nonadjacent edges covering every vertex of . Tutte proved that a graph of even order has a perfect matching if and only if holds for every [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph of even order with has a perfect matching unless if , where is defined as follows: if , and if .
Cite
@article{arxiv.2604.24241,
title = {Perfect matchings and $A_{\alpha}$-spectral radius in 1-binding graphs},
author = {Sizhong Zhou and Hongxia Liu},
journal= {arXiv preprint arXiv:2604.24241},
year = {2026}
}
Comments
11 pages