在通讯网络中,数据包可行分配问题可视为分数因子问题。孤立韧度是衡量网络易受攻击性的重要参数。研究了计算机网络中的一些理论问题,给出分数(a,b,n)一临界消去图的孤立韧度条件。
In communications networks, the feasible assignment of data packets is seen as a fractional factor problem. Isolated toughness is an important parameter to measure the vulnerability of a network. This paper studies the theoretical issues of computer networks and gives the isolated toughness condition for fractional (a, b, n)-critical deleted graphs.