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 inActa mathematica Sinica. English series Vol. 35; no. 7; pp. 1227 - 1237
Main Authors Gao, Wei, Guirao, Juan L. G., Chen, Yao Jun
Format Journal Article
LanguageEnglish
Published Beijing Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 01.07.2019
Springer Nature B.V
Subjects
Computer networks
Graphs
Mathematics
Mathematics and Statistics
Sharpness
Toughness
fractional
deleted graph
05C70
Graph
toughness
fractional factor
Online AccessGet full text

Cover

More Information
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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1439-8516
1439-7617
DOI:10.1007/s10114-019-8169-z