Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth

被引：0

作者：

Liu, Saihua ^{[1
]}

Ouyang, Chen ^{[2
]}

Ou, Jianping ^{[1
]}

机构：

[1] Wuyi Univ, Dept Math, Jiangmen, Peoples R China

[2] Dongguan Univ Technol, Sch Comp Sci & Technol, Dongguan 523000, Peoples R China

来源：

LINEAR & MULTILINEAR ALGEBRA | 2022年 / 70卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Girth; m-restricted edge connectivity; lambda(m)-optimal; super-lambda(m); CUTS LEAVING COMPONENTS; ORDER;

D O I：

10.1080/03081087.2020.1754749

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A -connected graph G is optimally m-restricted edge-connected if its m-restricted edge-connectivity equals the minimum m-edge-degree , and super m-restricted edge-connected if all minimum m-restricted edge cuts are trivial. In this study, a bound for the size of graphs with girth greater than any given integer l is obtained firstly. Then the second minimum degree conditions for optimally and super m-restricted edge-connected graphs with girth greater than l are provided. Furthermore, the relationship between optimally m-restricted edge connectivity and optimally -restricted edge connectivity is characterized.

引用

页码：1146 / 1158

页数：13

共 50 条

[1] Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
Meierling, Dirk
Volkmann, Lutz
DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1775 - 1781
[2] Sufficient conditions for a graph to be super restricted edge-connected
Wang, Shiying
Lin, Shangwei
NETWORKS, 2008, 51 (03) : 200 - 209
[3] Sufficient conditions for graphs to be λ′-optimal super-edge-connected and maximally edge-connected
Hellwig, A
Volkmann, L
JOURNAL OF GRAPH THEORY, 2005, 48 (03) : 228 - 246
[4] Sufficient conditions for a graph of diameter 2 to be super restricted edge-connected
Lin, Shangwei
Wang, Shiying
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 910 - 916
[5] Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
Yuan, Jun
Liu, Aixia
INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 163 - 167
[6] SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Volkmann, Lutz
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 567 - 573
[7] Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
Volkmann, Lutz
ARS COMBINATORIA, 2010, 96 : 105 - 114
[8] Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected
Zhang, Lei
Wang, Shiying
DISCRETE APPLIED MATHEMATICS, 2019, 255 : 320 - 325
[9] Ore type sufficient condition for a graph to be super restricted edge-connected
Wang, Ying-Qian
Li, Qiao
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2001, 35 (08): : 1253 - 1255
[10] Super-connected but not super edge-connected graphs
Zhou, Jin-Xin
Feng, Yan-Quan
INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 22 - 25

← 1 2 3 4 5 →