Loading…

A Toughness Condition for Fractional (k, m)-deleted Graphs Revisited

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...

Full description

Saved in:
Bibliographic Details
Published in:Acta mathematica Sinica. English series 2019-07, Vol.35 (7), p.1227-1237
Main Authors: Gao, Wei, Guirao, Juan L. G., Chen, Yao Jun
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1439-8516
1439-7617
DOI:10.1007/s10114-019-8169-z