浏览全部资源
扫码关注微信
新疆大学数学与系统科学学院
Published:2017
移动端阅览
[1]陈来焕,刘凤霞,孟吉翔.超图的连通度(英文)[J].新疆大学学报(自然科学版),2017,34(01):1-6.
[1]陈来焕,刘凤霞,孟吉翔.超图的连通度(英文)[J].新疆大学学报(自然科学版),2017,34(01):1-6. DOI: 10.13568/j.cnki.651094.2017.01.001.
DOI:10.13568/j.cnki.651094.2017.01.001.
一个连通图或连通超图的连通度是使得图或者超图不连通所需要去掉的最小点数.显然
一个图(超图)的连通度κ不超过它的最小度δ.如果κ=δ
则图(超图)称为极大连通的.在本文中
我们给出了一致、线性、边传递(点传递)连通超图和连通无钻石超图的极大连通性问题.
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.
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.
Brouwer A E,Mesner D M.The connectivity of strongly regular graphs[J].Eur J Combinat,1985,6:215-216.
Esfahanian A H.Lower-Bounds on the Connectivities of a Graph[J].J Graph Theory,1985,9:503-511.
F`abrega J,Fiol M A.Maximally connected digraphs[J].J Graph Theory,1989,13:657-668.
Soneoka T,Nakada H,Imase M,et al.Sufficient conditions for maximally connected dense graphs[J].Discrete Math,1987,63:53-66.
张昭,黄晓辉.传递图中的限制性边连通性[J].新疆大学学报(自然科学版),2004,21(4):357-360.
0
Views
127
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution