Summary: Let \(G\) be a graph, and let \(k,r\) be nonnegative integers with \(k\geq2\). A \(k\)-factor of \(G\) is a spanning subgraph \(F\) of \(G\) such that \(d_F(x)=k\) for each \(x\in V(G)\), where \(d_F(x)\) denotes the degree of \(x\) in \(F\). For \(S\subseteq V(G)\), \(N_G(S)=\bigcup_{x\in S}N_G(x)\). The binding number of \(G\) is defined by \(\operatorname{bind}(G)=\min\left\{\frac{|N_G(S)|}{|S|}:\emptyset \neq S\subset V(G), N_G(S)\neq V(G)\right\}\). In this paper, we obtain a binding number and neighborhood condition for a graph to have a \(k\)-factor excluding a given \(r\)-factor. This result is an extension of the previous results.