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-因子臨界圖的任意兩個(gè)不相鄰的頂點(diǎn)的度和的下界,同時(shí)說(shuō)明這些結果是最好可能的。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan