Degree sum conditions of ID-factor-critical graphs are studied.A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained,and the bound is sharp.
英
美
- 本文研究ID-因子临界图的度和条件；得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界；同时说明这些结果是最好可能的.
