首页 | 本学科首页   官方微博 | 高级检索  
     检索      

哈拉里图的可靠性分析
引用本文:何中市,杨晓帆.哈拉里图的可靠性分析[J].重庆大学学报(自然科学版),1996,19(6):14-19.
作者姓名:何中市  杨晓帆
作者单位:重庆大学系统工程及应用数学系
摘    要:在图的顶点相互独立地以常数据 概率失效的情况下,图的可靠度定义为删除失效顶点及顶关联的边所得到的图连通的概率。对一类具有最佳连通性的图-哈拉里图,得到可靠度的界,并分析了可靠度的渐近性质。

关 键 词:可靠度  渐近性  哈拉里图

Analysis of Reliability of the Harary Graph
He Zhongshi,Yang Xiaofan,Yi Dong.Analysis of Reliability of the Harary Graph[J].Journal of Chongqing University(Natural Science Edition),1996,19(6):14-19.
Authors:He Zhongshi  Yang Xiaofan  Yi Dong
Institution:He Zhongshi; Yang Xiaofan; Yi Dong
Abstract: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.
Keywords:s: reliability  asymptotic property  Harary graph
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号