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] Maximally edge-connected realizations and Kundu's k $k$-factor theorem
    Shook, James M. M.
    JOURNAL OF GRAPH THEORY, 2024, 105 (01) : 83 - 97
  • [22] 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
  • [23] 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
  • [24] Maximally connected p-partite uniform hypergraphs
    Shan, Erfang
    Zhao, Jing
    Kang, Liying
    DISCRETE APPLIED MATHEMATICS, 2019, 264 : 188 - 195
  • [25] Minimally (k, k)-edge-connected graphs
    Hennayake, K
    Lai, HJ
    Li, DY
    Ma, JZ
    JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 116 - 131
  • [26] 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
  • [27] Highly edge-connected detachments of graphs and digraphs
    Berg, AR
    Jackson, B
    Jordán, T
    JOURNAL OF GRAPH THEORY, 2003, 43 (01) : 67 - 77
  • [28] On the existence of super edge-connected graphs with prescribed degrees
    Tian, Yingzhi
    Meng, Jixiang
    Lai, Hongjian
    Zhang, Zhao
    DISCRETE MATHEMATICS, 2014, 328 : 36 - 41
  • [29] The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
    Yang, Weihua
    Tian, Yingzhi
    Li, Hengzhe
    Li, Hao
    Guo, Xiaofeng
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 304 - 309
  • [30] Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
    Merker, Martin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 91 - 108
12345