| 高可靠准随机网络的结构 |
| |
| 引用本文： | 张建州. 高可靠准随机网络的结构[J]. 电子科技大学学报(社会科学版), 1992, 0(2) |
| |
| 作者姓名： | 张建州 |
| |
| 作者单位： | 电子科技大学应用数学系 成都610054 |
| |
| 摘 要： | 研究了以下网络可靠性综合问题:对给定的p和q,以及边失效率(或点失效率)p,构造具有p个点和q条边的图,使其在仅考虑边失效率(或点失效率)为p时,所成网络的可靠性最高。特别讨论了p=1/2的情况。
|
| 关 键 词： | 图 网络 可靠性 网络可靠性综合 圈 连通性 |
STRUCTURE OF MOST RELIABLE RANDOM NETWORK |
| |
| Zhang Jianzhou. STRUCTURE OF MOST RELIABLE RANDOM NETWORK[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 1992, 0(2) |
| |
| Authors: | Zhang Jianzhou |
| |
| Abstract: | This paper discusses the following problem of reliable network synthesis: Given the number of nodes p , the number of edges q and edge failures ( or node failures) p, finding the graph with p nodes and q edges such that its reliability is largest within only having edge failures ( or node failures). A case of p=1/2 is only discussed here. |
| |
| Keywords: | graph network relibility network reliable synthesis cycle connectivity |
| 本文献已被 CNKI 等数据库收录！ |
|
