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

共 50 条

[21] On fractional (g, f, m)-deleted graphs [J].

Liu, Shuli .

2011 INTERNATIONAL CONFERENCE ON COMPUTERS, COMMUNICATIONS, CONTROL AND AUTOMATION (CCCA 2011), VOL II, 2010, :249-250

[22] Degree Conditions for Fractional (g, f, n′, m)-Critical Deleted Graphs and Fractional ID-(g, f, m)-Deleted Graphs [J].

Gao, Wei ;

Liang, Li ;

Xu, Tianwei ;

Zhou, Juxiang .

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2016, 39 :S315-S330

[23] Toughness for Fractional (2, b, k)-Critical Covered Graphs [J].

Su-Fang Wang ;

Wei Zhang .

Journal of the Operations Research Society of China, 2023, 11 :197-205

[24] Toughness for Fractional (2, b, k)-Critical Covered Graphs [J].

Wang, Su-Fang ;

Zhang, Wei .

JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023, 11 (01) :197-205

[25] Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs [J].

Gao, Wei ;

Zhang, Yunqing ;

Chen, Yaojun .

OPEN PHYSICS, 2018, 16 (01) :544-553

[26] TOUGHNESS AND DEGREE CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS [J].

Yuan, Yuan ;

Sun, Zhiren .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (02)

[27] Isolated toughness for fractional (2, b, k)-critical covered graphs [J].

Zhou, Sizhong ;

Pan, Quanru ;

Xu, Lan .

PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2023, 24 (01) :11-18

[28] Tight isolated toughness bound for fractional (k, n)-critical graphs [J].

Gao, Wei ;

Wang, Weifan ;

Chen, Yaojun .

DISCRETE APPLIED MATHEMATICS, 2022, 322 :194-202

[29] Toughness and fractional critical deleted graph [J].

Gao, Wei ;

Wang, Weifan .

UTILITAS MATHEMATICA, 2015, 98 :295-310

[30] TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS [J].

Gao, Wei ;

Liang, Li ;

Xu, Tianwei ;

Zhou, Juxiang .

JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2014, 51 (01) :55-65

← 1 2 3 4 5 →