English

Perfect matchings and $A_{\alpha}$-spectral radius in 1-binding graphs

Combinatorics 2026-04-28 v1

Abstract

Let GG be a graph with vertex set V(G)V(G) and edge set E(G)E(G). For α[0,1)\alpha\in[0,1), we use Aα(G)A_{\alpha}(G) and ρα(G)\rho_{\alpha}(G) to denote the AαA_{\alpha}-matrix and the AαA_{\alpha}-spectral radius of GG, respectively. The binding number \mboxbind(G)\mbox{bind}(G) of GG is defined by \mboxbind(G)=min{NG(X)X:XV(G),NG(X)V(G)}\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}. If \mboxbind(G)1\mbox{bind}(G)\geq1, then GG is called 1-binding. A perfect matching in GG is a set of nonadjacent edges covering every vertex of GG. Tutte proved that a graph GG of even order has a perfect matching if and only if o(GS)So(G-S)\leq|S| holds for every SV(G)S\subseteq V(G) [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 GG of even order nn with nn(α)n\geq n(\alpha) has a perfect matching unless G=K1(Kn5K3K1)G=K_1\vee(K_{n-5}\cup K_3\cup K_1) if ρα(G)ρα(K1(Kn5K3K1))\rho_{\alpha}(G)\geq\rho_{\alpha}(K_1\vee(K_{n-5}\cup K_3\cup K_1)), where n(α)n(\alpha) is defined as follows: n(α)=max{18,2+8α12α}n(\alpha)=\max\{18,\frac{2+8\alpha}{1-2\alpha}\} if α[0,12)\alpha\in[0,\frac{1}{2}), and n(α)=18n(\alpha)=18 if α=12\alpha=\frac{1}{2}.

Keywords

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

R2 v1 2026-07-01T12:36:44.075Z