In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. obtains a toughness condition for a graph to be fractional(k, m)-deleted and presents an...In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. obtains a toughness condition for a graph to be fractional(k, m)-deleted and presents an example to show the sharpness of the toughness bound. In this paper, we remark that the previous example does not work and inspired by this fact, we present a new toughness condition for fractional(k, m)-deleted graphs improving the existing one. Finally, we state an open problem.展开更多
基金partially supported by MINECO(Grant No.MTM2014–51891–P and Fundación Séneca de la Región de Murcia 19219/PI/14)National Science Foundation of China(Grant No.11401519)
文摘In computer networks, toughness is an important parameter which is used to measure the vulnerability of the network. Zhou et al. obtains a toughness condition for a graph to be fractional(k, m)-deleted and presents an example to show the sharpness of the toughness bound. In this paper, we remark that the previous example does not work and inspired by this fact, we present a new toughness condition for fractional(k, m)-deleted graphs improving the existing one. Finally, we state an open problem.
