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] Edge splitting and connectivity augmentation in directed hypergraphs
Berg, AR
Jackson, B
Jordán, T
DISCRETE MATHEMATICS, 2003, 273 (1-3) : 71 - 84
[42] Weak edge-degree domination in hypergraphs
Acharya B.D.
Gupta P.
Czechoslovak Mathematical Journal, 2006, 56 (1) : 99 - 108
[43] Weak edge-degree domination in hypergraphs
Acharya, Belmannu Devadas
Gupta, Purnima
CZECHOSLOVAK MATHEMATICAL JOURNAL, 2006, 56 (01) : 99 - 108
[44] ON THE WEAKLY POLYMATROIDAL PROPERTY OF THE EDGE IDEALS OF HYPERGRAPHS
Asghar, Rahim Rahmati
Yassemi, Siamak
COMMUNICATIONS IN ALGEBRA, 2014, 42 (03) : 1011 - 1021
[45] Extremal k-edge-hamiltonian hypergraphs
Frankl, Peter
Katona, Gyula Y.
DISCRETE MATHEMATICS, 2008, 308 (08) : 1415 - 1424
[46] Maximally edge-connected graphs and Zeroth-order general Randić index for α≤-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \le -1$$\end{document}
Guifu Su
Liming Xiong
Xiaofeng Su
Guojun Li
Journal of Combinatorial Optimization, 2016, 31 (1) : 182 - 195
[47] Classification of Edge-dependent Labels of Nodes in Hypergraphs
Choe, Minyoung
Kim, Sunwoo
Yoo, Jaemin
Shin, Kijung
PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023, 2023, : 298 - 309
[48] Edge coloring complete uniform hypergraphs with many components
Caro, Y
Yuster, R
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (02) : 215 - 227
[49] (k - 2)-linear connected components in hypergraphs of rank k
Galliot F.
Gravier S.
Sivignon I.
Discrete Mathematics and Theoretical Computer Science, 2023, 253
[50] Independence number of hypergraphs under degree conditions
Rodl, Vojtech
Sales, Marcelo
Zhao, Yi
RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (03) : 821 - 863

← 1 2 3 4 5 →