因子临界图
基于1个网页-相关网页
INDEPENDENT-SET-DELETABLE FACTOR-CRITICAL POWER GRAPHS 数学物理学报B辑英文版
factor-critical graphs
factor-critical图
以上为机器翻译结果,长、整句建议使用 人工翻译 。
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-因子临界图的任意两个不相邻的顶点的度和的下界,同时说明这些结果是最好可能的。
youdao
应用推荐
模块上移
模块下移
不移动