超图的连通度（英文）  

The Connectivity of Hypergraphs

作　　者：陈来焕[1] 刘凤霞[1] 孟吉翔[1] 

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830046

出　　处：《新疆大学学报（自然科学版）》2017年第1期1-6,共6页Journal of Xinjiang University(Natural Science Edition)

基　　金：supported by NSFC(11531011,11401510);the Key Laboratory Project of Xinjiang(2015KL019)

摘　　要：一个连通图或连通超图的连通度是使得图或者超图不连通所需要去掉的最小点数.显然,一个图(超图)的连通度κ不超过它的最小度δ.如果κ=δ,则图(超图)称为极大连通的.在本文中,我们给出了一致、线性、边传递(点传递)连通超图和连通无钻石超图的极大连通性问题.The connectivity of a connected graph or hypergraph is the minimum number of vertices whose removal renders the graph or hypergraph, respectively, disconnected. Clearly, the connectivity κ of a graph（hypergraph） cannot exceed its minimum degree δ. If κ = δ, then the graph（hypergraph） is called maximally connected. In this paper, we present the maximal connectivity of the uniform, linear, edge transitive（vertex transitive） connected hypergraphs and the connected diamond-free hypergraphs.

关 键 词：连通度 边传递 点传递 无钻石 超图 

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