【摘要】 设G是一个图,a,b是整数且0≤a≤b,G的一个支撑子图F称为一个[a,b]-因子,若对任意的v∈V(G)有a≤d_F(v)≤b.在本文中,我们给出了图存在[a,b]-因子涉及到独立数和最小度的一个充分条件,推广了前人的结果.更多还原

【Abstract】 Let G be a graph,a and b be integers such that 0(?)a(?)b,a spanning subgraph F of G is called an [a,b]-factor if a(?)dF(v)(?)b for all v∈V(G).It gives a sufficient condition for theexistence of an[a,b]-factor in a graph in terms of its minimum degree and independence number.更多还原