超级边连通r一致超图的充分条件  

Sufficient Conditions of Super-edge Connected r of Uniform Hypergraphs

作　　者：裴建峰 林上为[1] PEI Jianfeng;LIN Shangwei(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)

机构地区：[1]山西大学数学科学学院,太原030006

出　　处：《河南科学》2018年第2期141-145,共5页Henan Science

基　　金：国家自然科学基金(61202017)

摘　　要：若一个连通图的任一最小边割一定是某个顶点的关联边集,那么称该图是超级边连通的.对超级边连通图的研究,不仅有理论意义,而且在网络可靠性的分析中也有广泛应用.超图是图的一个自然推广.论文将超级边连通性的概念推广到超图,给出超级边连通一致超图的最小度条件,并用例子说明所给的条件是紧的.所得结果是无向图相关结果的推广.A connected graph is super-edge connected if its any minimum edge cut must be the set of edges incident with a vertex.The study on the super-edge connected graphs not only has the theoretical significance,butalso is widely used in the analysis of network reliability.Hypergraphs are natural extensions of graphs.In this paper,the concept of super-edge connectivity is generalized to hypergraphs,a minimum degree condition of super-edge connected uniform hypergraphs is given,and an example is given to show the above result is the best possible.The results in this paper are generalizations of corresponding results in graphs.

关 键 词：一致超图 边连通度 最小度 

分 类 号：O157.5[理学—数学]