English

运筹学学报（中英文） ›› 2026, Vol. 30 ›› Issue (1): 256-266.doi: 10.15960/j.cnki.issn.1007-6093.2026.01.019

• • 上一篇    

孤立韧度变种与分数[a,b]-因子存在性

高炜1,†, 王维凡2   

  1. 1. 河海大学数学学院, 江苏南京 211100;
    2. 山东理工大学数学与统计学院, 山东淄博 255049
  • 收稿日期:2022-12-04 发布日期:2026-03-16
  • 通讯作者: 高炜 E-mail:gaowei@hhu.edu.cn
  • 基金资助:
    国家自然科学基金 (No. 12161094), 中央高校基本科研业务费专项资金项目 (No. B250201225)

Isolated toughness variant and the existence of fractional [a,b]-factor

GAO Wei1,†, WANG Weifan2   

  1. 1. School of Mathematics, Hohai University, Nanjing 211100, Jiangsu, China;
    2. School of Mathematics and Statistics, Shandong University of Technology, Zibo 255049, Shandong, China
  • Received:2022-12-04 Published:2026-03-16

PDF

2

摘要： 分数因子存在性问题是图因子理论研究的重要课题, 而孤立韧度是衡量网络易受攻击性的重要参数。作为孤立韧度的唯一变种, $I'(G)$定义为$|S|$ 和$i(G-S)-1$ 的最小比值, 其中$S$ 是满足$i(G-S)\ge2$的顶点子集。该图参数从拓扑结构出发衡量了网络的坚固程度, 并且最近的研究发现其与分数因子之间存在密切的联系。本文给出了一个图存在分数$[a,b]$-因子的$I'(G)$条件, 并且说明该条件是紧的。该结果推广了原来关于分数$k$-因子存在性的$I'(G)$ 紧界。

关键词: 图, 分数因子, 分数$[a,b]$-因子, 孤立韧度变种

Abstract: The existence of fractional factors in specific settings is an important topic of graph factor theory, and isolated toughness is an important parameter to measure the vulnerability of networks. As the unique variant of isolation toughness, $I'(G)$ is defined as the minimum ratio of $|S|$ and $i(G-S)-1$, where $S$ is the subset of vertices that satisfies $i(G-S)\ge2$. This parameter measures the robustness of the network from the perspective of topology, and recent research reveals that it is closely related to the fractional factor. In this paper, we give an $I'(G)$ condition for the existence of fractional $[a,b]$-factors in a graph, and show that the condition is sharp by counterexample. This result extends the original $I'(G)$ tight bound on the existence of the fractional $k$-factor.

Key words: graph, fractional factor, fractional$[a,b]$-factor, isolated toughness variant

中图分类号: