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 条
  • [31] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [32] Maximally edge-connected realizations and Kundu's k $k$-factor theorem
    Shook, James M. M.
    JOURNAL OF GRAPH THEORY, 2024, 105 (01) : 83 - 97
  • [33] 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
  • [34] 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
  • [35] Maximally edge-connected graphs and Zeroth-order general RandiA‡ index for
    Su, Guifu
    Xiong, Liming
    Su, Xiaofeng
    Li, Guojun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 182 - 195
  • [36] 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
  • [37] Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
    Hong, Zhen-Mu
    Xia, Zheng-Jiang
    Chen, Fuyuan
    Volkmann, Lutz
    COMPLEXITY, 2021, 2021
  • [38] The constructive characterization of (κ,a"")-edge-connected digraphs
    Kovacs, Erika R.
    Vegh, Laszlo A.
    COMBINATORICA, 2011, 31 (02) : 201 - 223
  • [39] Vulnerability of super edge-connected networks
    Hong, Zhen-Mu
    Xu, Jun-Ming
    THEORETICAL COMPUTER SCIENCE, 2014, 520 : 75 - 86
  • [40] Equitable factorizations of edge-connected graphs
    Hasanvand, Morteza
    DISCRETE APPLIED MATHEMATICS, 2022, 317 : 136 - 145
12345