As two significant performance indicators, structure connectivity and substructure connectivity have been widely studied, and they are used to judge a network’s fault tolerance properties from the perspective of the structure becoming faulty. An n-dimensional bubble-sort star graph BSn is a popular interconnection network with many good properties. We find the upper bounds of κ(BSn;K1,3) and κs(BSn;K1,3) in this paper. Furthermore, we establish κ(BSn;H) and κs(BSn;H) of BSn, where H∈{K1,K1,1,K1,2}
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
As two significant performance indicators, structure connectivity and substructure connectivity have...
Diagnosability of a multiprocessor system is an important topic of study. A measure for fault diagno...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
AbstractThe bubble-sort graph Bn is one of the attractive underlying topologies for distributed syst...
The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. Th...
The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. Th...
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are...
Many multiprocessor systems have interconnection networks as underlying topologies and an interconne...
It is well known that star graphs are strongly resilient like the ncubes in the sense that they are ...
It is well known that star graphs are strongly resilient like the ncubes in the sense that they are ...
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
As two significant performance indicators, structure connectivity and substructure connectivity have...
Diagnosability of a multiprocessor system is an important topic of study. A measure for fault diagno...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
AbstractThe bubble-sort graph Bn is one of the attractive underlying topologies for distributed syst...
The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. Th...
The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. Th...
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are...
Many multiprocessor systems have interconnection networks as underlying topologies and an interconne...
It is well known that star graphs are strongly resilient like the ncubes in the sense that they are ...
It is well known that star graphs are strongly resilient like the ncubes in the sense that they are ...
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
The star graph is an attractive underlying topology for distributed systems. Robustness of the star ...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...