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-因子临界图的任意两个不相邻的顶点的度和的下界，同时说明这些结果是最好可能的。
Bound always by protocol, Mirren's Elizabeth is still surprisingly witty and sharp; on learning of Blair's electoral success, she wishes she could be 'partial' sometimes.
方向总是由议定书，省事的伊丽莎白仍是出奇机智和敏锐；学习对布莱尔的选举成功，她希望她可以'局部'有时。
Bound always by protocol, Mirren's Elizabeth is still surprisingly witty and sharp; on learning of Blair's electoral success, she wishes she could be 'partial' sometimes.
方向总是由议定书，省事的伊丽莎白仍是出奇机智和敏锐；学习对布莱尔的选举成功，她希望她可以'局部'有时。
应用推荐