军事知识服务平台
Spectral Condition for Perfect Integer k-matching in Graphs
摘要 An integer k-matching of a graph G is a function h:E(G)→ {0,1,...,k} such that ∑e∈Γ(v)h(e)≤k for any v ∈ V(G),where Γ(v)is the set of edges incident with v.An integer k-matching h is perfect if and only if ∑e∈E(G)h(e)=k|2(G)|/2.Brouwer and Haemers[Eigenvalues and perfect matchings.Linear Algebra Appl.,395,155-162(2005)]initially studied the existence of a perfect integer 1-matching in a regular graph in terms of the third largest adjacency eigenvalue.For odd integer k ≥ 3,Zhang and Fan[Perfect integer k-matching,k-factor-critical,and the spectral radius of graphs.Linear Algebra Appl.,701,97-111(2024)]showed a condition based on the spectral radius to ensure the existence of a perfect integer k-matching in a connected graph.By imposing the minimum degree as a parameter,we extend the result of Zhang and Fan.In this paper,we provide the spectral radius condition and size condition for the existence of a perfect integer k-matching in a connected graph with fixed minimum degree,respectively.
刊 名 数学学报(英文版) ISTICSCI
年,卷(期): 2026, 42(10)
分类号: 05C50
机标分类号: TP311
在线出版日期: 2026年10月29日