Binding number, \(k\)-factor and spectral radius of graphs (Q6197802)

Summary: The binding number \(b(G)\) of a graph \(G\) is the minimum value of \(|N_G(X)|/|X|\) taken over all non-empty subsets \(X\) of \(V(G)\) such that \(N_G(X)\neq V(G)\). The association between the binding number and toughness is intricately interconnected, as both metrics function as pivotal indicators for quantifying the vulnerability of a graph. The Brouwer-Gu Theorem asserts that for any \(d\)-regular connected graph \(G\), the toughness \(t(G)\) always at least \(\frac{d}{\lambda}-1\), where \(\lambda\) denotes the second largest absolute eigenvalue of the adjacency matrix. Inspired by the work of \textit{A. E. Brouwer} [Linear Algebra Appl. 226--228, 267--271 (1995; Zbl 0833.05048)] and \textit{X. Gu} [SIAM J. Discrete Math. 35, No. 2, 948--952 (2021; Zbl 1465.05102), in this paper, we investigate \(b(G)\) from spectral perspectives, and provide tight sufficient conditions in terms of the spectral radius of a graph \(G\) to guarantee \(b(G)\geqslant r\). The study of the existence of \(k\)-factors in graphs is a classic problem in graph theory. \textit{P. Katerinis} and \textit{D. R. Woodall} [Q. J. Math., Oxf. II. Ser. 38, 221--228 (1987; Zbl 0639.05050)] state that every graph with order \(n\geqslant 4k-6\) satisfying \(b(G)\geqslant 2\) contains a \(k\)-factor where \(k\geqslant 2\). This leaves the following question: which \(1\)-binding graphs have a \(k\)-factor? In this paper, we also provide the spectral radius conditions of \(1\)-binding graphs to contain a perfect matching and a \(2\)-factor, respectively.