摘要
引入了拟正则(p,q)图的最大线图连通度R(p,q),得到上、下界至多相差1的R(p,q)的取值范围:2m-2≤R(p,q)≤2m-其中(2q)medp.将此结果应用于容错多总线系统的最优设计,提出了两类最优容错设计,推广了己有结果;并揭示出当处理机个数相对于总线条数较大时最优容错设计的广泛存在性。
The maximum connectivity R(p,q)of the line graph over quasi-regular(p,q)graphs is discussed.A bound on R(p,q)2m-2≤R(p,q)presented,wherem:modp.Further two classes of fault tolerant multibus systems are proposed;As a result,the previous results are generalized;meanwhile,the wide-rangingexistence of the optimal fault tolerant design is revealed when the number of processors/thenumber of buses is large.
出处
《重庆大学学报(自然科学版)》
CAS
CSCD
1995年第2期21-26,共6页
Journal of Chongqing University
基金
国家自然科学基金
关键词
图连通性
拟正则图
线图
多总线系统
connectivity of graph
fault tolerant technique/quasi-regular g8raphs
linegraph
multibus system