折叠超立方体网络的t/k诊断问题  

The t/k diagnosability of folded cubes

作　　者：谭学功[1] 

机构地区：[1]暨南大学华文学院,广东广州510610

出　　处：《暨南大学学报（自然科学与医学版）》2010年第3期245-247,252,共4页Journal of Jinan University(Natural Science & Medicine Edition)

基　　金：国家民委青年基金项目(09HB06);国家社会科学基金项目(09XM2045);中央高校基本科研业务费专项资金资助项目

摘　　要：为提高系统故障诊断的诊断度,Somani和Peleg提出了t/k诊断故障策略.n维折叠超立方体网络是具有2n个顶点,(n+1)2n-1条边的(n+1)-维正则图,它是n维超立方体网络增加2n-1补边得到的.文中证明了当n≥6和1≤k≤n+1时n维超立方体网络是t/k可诊断的,其中t=(k+1)(n+1)-1/2(k+1)(k+2)+1.To increase degree of diagnosability in system,Somani and Peleg proposed a new diagnosis strategy,which is called t/k-diagnosis strategy.The n-dimensional Folded Cube is（n＋1）-regular graph with 2n nodes and（n＋1）2n-1 edges,which is obtained by adding 2n-1 complementary edges to n-dimensional hypercube.The n-dimensional folded cube is t/k diagnosability,where n≥6,1≤k≤n＋1 and t=（k＋1）（n＋1）-1/2（k＋1）（k＋2）＋1.

关 键 词：互连网络 超立方体 折叠超立方体 t/k诊断 

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