【摘要】 设H是连通超图。若超图H的边连通度等于其最小度,则称H是最大边连通的。若超图H的每个最小边割总是由关联于某个最小度顶点的边集所构成,则称H是super-边连通的。首先给出一致线性超图是最大边连通超图的度序列条件。其次,给出一致线性超图是super-边连通超图的度条件。这些结果分别推广了D ankelmann和Volkmann (1997)以及Hellwig和Volkmann(2 005)在图上的相关结论。更多还原

【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.更多还原