图的断裂度与断裂数的关系  

On Using Concept of Degree of Rupture for Designing Reliable Network

作　　者：张胜贵[1] 王自果[1] 袁亚华[1] 

机构地区：[1]西北工业大学

出　　处：《西北工业大学学报》1995年第2期310-313,共4页Journal of Northwestern Polytechnical University

基　　金：航空科学基金

摘　　要：对图的断裂度和断裂数进行了研究．在图的断裂度已知的条件下，给出了其断裂数的取值范围；在图的某个断裂数已知时，给出其断裂度的取值范围．最后对断裂度和断裂数的实际应用进行了探讨．Connectivity is the mathematical concept often used to attack the problem of reliability of communication and computer network. In 1989 Ouyang et al proposed the concept of degree of rupture [2].Starting from the concept of degree of rupture, we derive some results that are believed to be helpful in designing network more reliable than possible with the concept of connectivity.Eqs. (1), (2)and (3) are the main useful results of this paper. In these equations, n is the number of vertices, b is degree of rupture, and p is rupture number. If n and b are given, eqs. (1) and (2) give respectively the upper and lower limits of p. If n and p are given, eq. (3) gives the upper and lower limits of b.Essentially, the concept of degree of rupture appears to be better than that of connectivity in that it can inform the designer of the seriousness of network damage; such seriousness can not be determined when the concept of conncctivity is used. As late as 1976, Bondy et al [1] still recommended the method based on connectivity and proposed by Harary in 1962[3] for improving network reliability.

关 键 词：断裂度 断理解度集 断裂数 图 

分 类 号：O175.5[理学—数学]