图κ-限制边连通度λ κ-最优图超级-λ κ图论文.doc

文档介绍：图的k-限制边连通度性质的研究
【摘要】随着经济和科技的迅猛发展,网络与人们的工作、,,,它存在着不足之处:首先,边连通度相同的图可靠度可能不同;其次,不能区分删掉κ个割断点或λ条割断边得到的图的不同类型,即未考虑对网络的破坏程度;第三,,,经过二十多年的发展,条件边连通度所涉及的内容日益丰富和具体,包括超级边连通度、过边连通度、,通常包括某些类型的图模型,其中一个重要模型是这样的图:设图G=(V, E),其节点不会失效,每一条边是独立失效的,失效概率为p∈(0,1).用Ni(G)表示边数为i的边割的数目,则G连通的概率R(G,p)为:R(G,p)=1-(?) Ni(G)pi(1-p)ε-i, i=λ(G)其中ε是G的边数,A(G)... 更多还原
【Abstract】 With the development of social economy, science and technology, the relationship between man works es more and more closely. Naturally, the research about the reliability and fault-tolerability works is very active at home and abroad. As we know, edge connectivity plays an important role in the connectivity of graph. But the concept of the classical edge connectivity has some obvious deficiencies. Firstly, even two graphs with the same edge connectivity may be considered to hav...
 更多还原
【关键词】图; κ-限制