Sufficient Conditions for Maximally Edge-Connected Hypergraphs

被引：0

作者：

Lin-Ken Tong

Er-Fang Shan

机构：

[1] Shanghai University,Department of Mathematics

[2] Shanghai University,School of Management

来源：

Journal of the Operations Research Society of China | 2021年 / 9卷

关键词：

Hypergraph; Edge-connectivity; Maximally edge-connected; 05C65; 05C70;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The edge-connectivity of a graph or a hypergraph is defined as the minimum number of edges whose removal renders the graph or hypergraph disconnected. A graph or hypergraph is called maximally edge-connected if the edge-connectivity equals its minimum degree. In this paper, we show that some classical sufficient conditions for graphs to be maximally edge-connected can be generalized to hypergraphs.

引用

页码：119 / 129

页数：10

共 50 条

[21] Sufficient conditions for maximally restricted edge connected graphs
Qin, Yingying
Ou, Jianping
DISCRETE MATHEMATICS, 2012, 312 (19) : 2969 - 2972
[22] Degree sequence conditions for maximally edge-connected graphs depending on the clique number
Dankelmann, P
Volkmann, L
DISCRETE MATHEMATICS, 2000, 211 (1-3) : 217 - 223
[23] 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
[24] CONSTRUCTION OF A MAXIMALLY EDGE-CONNECTED GRAPH WITH PRESCRIBED DEGREES
WANG, DL
STUDIES IN APPLIED MATHEMATICS, 1976, 55 (01) : 87 - 92
[25] Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
Milz, Sebastian
Volkmann, Lutz
DISCRETE MATHEMATICS, 2018, 341 (02) : 484 - 491
[26] Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
Meierling, Dirk
Volkmann, Lutz
DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1775 - 1781
[27] Maximally edge-connected and vertex-connected graphs and digraphs: A survey
Hellwig, Angelika
Volkmann, Lutz
DISCRETE MATHEMATICS, 2008, 308 (15) : 3265 - 3296
[28] Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
Volkmann, Lutz
ARS COMBINATORIA, 2011, 99 : 55 - 64
[29] Sufficient conditions for graphs to be maximally 4-restricted edge connected
Wang, Mujiangshan
Lin, Yuqing
Wang, Shiying
Wang, Meiyu
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 70 : 123 - 136
[30] Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
Liu, Saihua
Ouyang, Chen
Ou, Jianping
LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (06): : 1146 - 1158

← 1 2 3 4 5 →