超图的连通度（英文）The Connectivity of Hypergraphs
陈来焕;刘凤霞;孟吉翔;
摘要(Abstract)：
一个连通图或连通超图的连通度是使得图或者超图不连通所需要去掉的最小点数.显然,一个图(超图)的连通度κ不超过它的最小度δ.如果κ=δ,则图(超图)称为极大连通的.在本文中,我们给出了一致、线性、边传递(点传递)连通超图和连通无钻石超图的极大连通性问题.
关键词(KeyWords)： 连通度;边传递;点传递;无钻石;超图
基金项目(Foundation): supported by NSFC(11531011,11401510);; the Key Laboratory Project of Xinjiang(2015KL019)
作者(Authors): 陈来焕;刘凤霞;孟吉翔;
DOI: 10.13568/j.cnki.651094.2017.01.001
参考文献(References)：
- [1]Tindell R.Connectivity of Cayley digraphs[A].in Combinational Network Theory(D Z Du and D F Hsu eds).Kluwer Academic Publishers,1996,41-64.
- [2]Brouwer A E,Mesner D M.The connectivity of strongly regular graphs[J].Eur J Combinat,1985,6:215-216.
- [3]Esfahanian A H.Lower-Bounds on the Connectivities of a Graph[J].J Graph Theory,1985,9:503-511.
- [4]F`abrega J,Fiol M A.Maximally connected digraphs[J].J Graph Theory,1989,13:657-668.
- [5]Soneoka T,Nakada H,Imase M,et al.Sufficient conditions for maximally connected dense graphs[J].Discrete Math,1987,63:53-66.
- [6]张昭,黄晓辉.传递图中的限制性边连通性[J].新疆大学学报(自然科学版),2004,21(4):357-360.