哈拉里图的可靠性分析

Analysis of Reliability of the Harary Graph

在图的顶点相互独立地以常数概率失效的情况下，图的可靠度定义为删除失效顶点及与之相关联的边所得到的图连通的概率。对一类具有最佳连通性的图——哈拉里图，得到可靠度的界，并分析了可靠度的渐近性质。

When the vertices fail independently with each other by a constant probability,the reliability of a sraph is defined to be the probability that the graph results from deleting thefailed venices together with the incidence edges is connected. The Harary graph,a class of graphswith the best connectivity is considered in this paper,the bound of it's reliability is obtained,and theasymptotic property of reliability is also analysed.