期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
The relationship between extra connectivity and t/k-diagnosability under the PMC model
1
作者 肖志芳 ZHONG Guoxuan +2 位作者 CHEN Jianqi GUO Chen PENG Shuo 《High Technology Letters》 EI CAS 2023年第3期305-309,共5页
It is well-known that connectivity is closely related to diagnosability.If the relationships be-tween them can be established,many kinds of diagnosability will be determined directly.So far,some notable relationships ... It is well-known that connectivity is closely related to diagnosability.If the relationships be-tween them can be established,many kinds of diagnosability will be determined directly.So far,some notable relationships between connectivity and diagnosability had been revealed.This paper in-tends to find out the relationship between extra connectivity and t/k-diagnosability under the PMC(Preparata,Metze,and Chien)model.Then,applying this relationship,the t/k-diagnosability of bijective connection(BC)networks are determined conveniently. 展开更多
关键词 extra connectivity t/k-diagnosability the PMC model
下载PDF
On Restricted Connectivity and Extra Connectivity of Hypercubes and Folded Hypercubes 被引量:12
2
作者 徐俊明 朱强 +1 位作者 侯新民 周涛 《Journal of Shanghai Jiaotong university(Science)》 EI 2005年第2期203-207,共5页
Given a graph G and a non-negative integer h, the h-restricted connectivity κh(G) of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whos... Given a graph G and a non-negative integer h, the h-restricted connectivity κh(G) of G is the minimum cardinality of a set of vertices of G, in which at least h neighbors of any vertex is not included, if any, whose deletion disconnects G and every remaining component has the minimum degree of vertex at least h; and the h-extra connectivity κh(G) of G is the minimum cardinality of a set of vertices of G, if any, whose deletion disconnects G and every remaining component has order more than h. This paper shows that for the hypercube Qn and the folded hypercube FQn, κ1(Qn)=κ(1)(Qn)=2n-2 for n≥3, κ2(Qn)=3n-5 for n≥4, κ1(FQn)=κ(1)(FQn)=2n for n≥4 and κ(2)(FQn)=4n-4 for n≥8. 展开更多
关键词 connectivity conditional connectivity restricted connectivity extra connectivity HYPERCUBE folded hypercube
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部