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 条
  • [41] Super-connected but not super edge-connected graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 22 - 25
  • [42] The constructive characterization of (κ,ℓ)-edge-connected digraphs
    Erika R. Kovács
    László A. Végh
    Combinatorica, 2011, 31 : 201 - 223
  • [43] Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs
    Wang, Shiying
    Peng, Kai
    Cuo, Yubao
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (05) : 583 - 598
  • [44] Maximally edge-connected graphs and Zeroth-order general Randic index for 0 < α < 1
    Su, Guifu
    Xiong, Liming
    Su, Xiaofeng
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 261 - 268
  • [45] Vulnerability of super extra edge-connected graphs
    Cheng, Chia-Wen
    Hsieh, Sun-Yuan
    Klasing, Ralf
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 108 : 1 - 9
  • [46] Maximally connected p-partite uniform hypergraphs
    Shan, Erfang
    Zhao, Jing
    Kang, Liying
    DISCRETE APPLIED MATHEMATICS, 2019, 264 : 188 - 195
  • [47] Minimally (k, k)-edge-connected graphs
    Hennayake, K
    Lai, HJ
    Li, DY
    Ma, JZ
    JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 116 - 131
  • [48] Degree sequences of optimally edge-connected multigraphs
    Dankelmann, P
    Oellermann, O
    ARS COMBINATORIA, 2005, 77 : 161 - 168
  • [49] Highly edge-connected detachments of graphs and digraphs
    Berg, AR
    Jackson, B
    Jordán, T
    JOURNAL OF GRAPH THEORY, 2003, 43 (01) : 67 - 77
  • [50] Super-cyclically edge-connected regular graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 393 - 411
12345