A Toughness Condition for Fractional (k, m)-deleted Graphs Revisited
- 14 Downloads
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.
KeywordsGraph fractional factor fractional (k, m)-deleted graph toughness
MR(2010) Subject Classification05C70
Unable to display preview. Download preview PDF.