苏州科技大学学报（自然科学版）2022，Vol.39Issue(2)：70-78,9.DOI:10.12084/j.issn.2096-3289.2022.02.010
两种框架下的太阳韧度及P≥3-因子存在性
Sun toughness and existence of P≥3-factor in two settings
摘要
Abstract
Motivated by toughness and isolated toughness,reference [9] introduced a new variable,sun toughness. For a non-complete graph G,its sun toughness s(G) is formulated by minimizing the ratio|S|/sun(G-S) with sun(G-S)≥2. In this paper,two statements have been obtained:(1)if a non-complete graph G satisfies κ(G)≥m and s (G)>1 (resp. s'(G)>3/2),G is a (P≥3,m)-factor deleted graph. (2)G is a (P≥3,k)-factor critical graph if s(G)>(k+1)/3 or s'(G)> (k+1)/2 when κ≥k+2 (resp. s (G)>(k+2)/3 or s' (G)>(k+2)/2 when κ≥k+1). Furthermore,we proved that these sun toughness bounds are sharp.关键词
图/路径因子/(P≥3,m)-因子消去图/太阳韧度Key words
graph/path-factor/(P≥3,m)-factor deleted graph/sun toughness分类
信息技术与安全科学引用本文复制引用
兰美辉,高炜..两种框架下的太阳韧度及P≥3-因子存在性[J].苏州科技大学学报（自然科学版）,2022,39(2):70-78,9.基金项目
国家自然科学基金地区基金资助项目(11761083) （11761083）
