Abstract
Isolated toughness is a crucial parameter considered in network security which characterizes the vulnerability of the network from the perspective of graph topology. I’(G) is the unique variant of isolated toughness which was introduced in 2001. This work investigates the correlation of I’(G) and the existence of fractional factor. It is proved that a graph G with δ(G) ≥ k admits fraction k-factor if I’(G) > 2k − 1, where k ≥ 2 is an integer. A counterexample is presented to show the sharpness of I’(G) bound.
Funder
National Science Foundation of China
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献