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

被引：35

作者：

Gao, Wei ^{[1
,2
]}

Guirao, Juan L. G. ^{[3
]}

Chen, Yao Jun ^{[1
]}

机构：

[1] Nanjing Univ, Dept Math, Nanjing 210093, Jiangsu, Peoples R China

[2] Yunnan Normal Univ, Sch Informat Sci & Technol, Kunming 650500, Yunnan, Peoples R China

[3] Univ Politecn Cartagena, Hosp Marina, Dept Matemat Aplicada & Estadist, Cartagena 30203, Region De Murci, Spain

来源：

ACTA MATHEMATICA SINICA-ENGLISH SERIES | 2019年 / 35卷 / 07期

基金：

美国国家科学基金会;

关键词：

Graph; fractional factor; fractional; (k; m)-deleted graph; toughness; DESIGN; NETWORKS;

D O I：

10.1007/s10114-019-8169-z

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：1227 / 1237

页数：11

共 26 条

[1]

[Anonymous], 2017, APPL MATH NONLIN SCI

[2] On designing heteroclinic networks from graphs [J].

Ashwin, Peter ;

Postlethwaite, Claire .

PHYSICA D-NONLINEAR PHENOMENA, 2013, 265 :26-39

[3]

Basavanagoud B., 2017, APPL MATH NONL SC, V2, P21

[4]

Bondy J.A., 2008, GTM

[5]

Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6

[6] Applying Graph Theory to Design Networks of Protected Areas: Using Inter-Patch Distance for Regional Conservation Planning [J].

Crouzeilles, Renato ;

Lorini, Maria Lucia ;

de Viveiros Grelle, Carlos Eduardo .

NATUREZA & CONSERVACAO, 2011, 9 (02) :219-224

[7] New Graph Model to Design Optical Networks [J].

de Araujo, Danilo R. B. ;

Martins-Filho, Joaquim F. ;

Bastos-Filho, Carmelo J. A. .

IEEE COMMUNICATIONS LETTERS, 2015, 19 (12) :2130-2133

[8] Design of Optimal Sparse Interconnection Graphs for Synchronization of Oscillator Networks [J].

Fardad, Makan ;

Lin, Fu ;

Jovanovic, Mihailo R. .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2014, 59 (09) :2457-2462

[9] The fifth geometric-arithmetic index of bridge graph and carbon nanocones [J].

Gao, W. ;

Wang, W. F. .

JOURNAL OF DIFFERENCE EQUATIONS AND APPLICATIONS, 2017, 23 (1-2) :100-109

[10] NEW ISOLATED TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n) - CRITICAL GRAPH [J].

Gao, Wei ;

Wang, Weifan .

COLLOQUIUM MATHEMATICUM, 2017, 147 (01) :55-65

← 1 2 3 →