苏州科技大学学报（自然科学版）2023，Vol.40Issue(2)：20-26,7.DOI:10.12084/j.issn.2096-3289.2023.02.003
孤立韧度变量和分数(k,n)-临界图
Isolated toughness variable and fractional(k,n)-critical graphs
摘要
Abstract
Isolated toughness variable I'(G)is an effective measurement of network robustness,which defines by mini-mumratio of |S| and i(G-S)-1,where S?V(G)satisfyies i(G-S)＞1.Graph G is a fractional(k,n)-critical graph,if any n vertices are removed from G,the resulting subgraphs still admit a fractional k-factor.Based on the findings of Reference[10],which obtained the tight I'(G)bound of existence of fractional k-factor,this study generalizes the result of it to frac-tional critical graphs:if δ(G)≥k+n and I'(G)＞2k+n-1,then G is a fractional(k,n)-critical graph,wherek≥2 and n≥0 are integers.关键词
图/孤立韧度变量/分数k-因子/分数(k,n)-临界图Key words
graph/isolated toughness variable/fractional k-factor/fractional(k,n)-critical graph分类
数理科学引用本文复制引用
高炜..孤立韧度变量和分数(k,n)-临界图[J].苏州科技大学学报（自然科学版）,2023,40(2):20-26,7.基金项目
国家自然科学基金资助项目(12161094) （12161094）
