| 最大边连通和super-边连通超图的充分条件 |
| |
| 引用本文： | 赵静,单而芳,赵加贵.最大边连通和super-边连通超图的充分条件[J].运筹学学报,2021,25(1):123-131. |
| |
| 作者姓名： | 赵静 单而芳 赵加贵 |
| |
| 作者单位： | 1. 上海大学数学系, 上海 200444;2. 上海大学管理学院, 上海 200444;3. 上海公安学院, 上海 200137 |
| |
| 基金项目： | 国家自然科学基金(No.11971298)。 |
| |
| 摘 要： | 设H是连通超图。若超图H的边连通度等于其最小度，则称H是最大边连通的。若超图H的每个最小边割总是由关联于某个最小度顶点的边集所构成，则称H是super-边连通的。首先给出一致线性超图是最大边连通超图的度序列条件。其次，给出一致线性超图是super-边连通超图的度条件。这些结果分别推广了Dankelmann和Volkmann（1997）以及Hellwig和Volkmann（2005）在图上的相关结论。
|
| 关 键 词： | 超图 边连通度 最大边连通超图 super-边连通 度序列最小度 |
| 收稿时间： | 2018-04-04 |
Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected |
| |
| ZHAO Jing,SHAN Erfang,ZHAO Jiagui.Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected[J].OR Transactions,2021,25(1):123-131. |
| |
| Authors: | ZHAO Jing SHAN Erfang ZHAO Jiagui |
| |
| Institution: | 1. Department of Mathematics, Shanghai University, Shanghai 200444, China;2. School of Management, Shanghai University, Shanghai 200444, China;3. Shanghai Police College, Shanghai 200137, China |
| |
| Abstract: | Let H be a connected hypergraph.The hypergraph H is called maximally edge connected if its edge connectivity is equal to minimum degree.The hypergraph H is super-edge-connected,if every minimum edge-cut consists of edges adjacent to a vertex of minimum degree.In this paper we give simple degree sequence conditions for uniform linear hypergraphs to be maximally edge-connected.Also,we give a sufficient condition for uniform linear hypergraphs to be super-edge-connected.These results generalize previous results on graphs due to Dankelmann and Volkmann(1997),Hellwig and Volkmann(2005)to hypergraphs. |
| |
| Keywords: | hypergraph edge connectivity maximally edge connected degree sequence super-edge-connected minimum degree |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
