Add to ORKGAbstract. An important issue in computer communication networks is fault-tolerant routing. A popular graph topology for interconnection network is the star graph [1]. We know from [6] that if up to 2n−4 vertices are deleted, the resulting graph has a single large component and at most one other component of size at most two. This paper will discuss routing in the large component and also show that its diameter in the faulty star graph is bounded by diam(Sn) + 9
The diameter of a network in the presence of faulty nodes is an important indicator of its resilienc...
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...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
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 ...
It is well known that star graphs are strongly resilient like the n cubes 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 ...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
The diameter of a network in the presence of faulty nodes is an important indicator of its resilienc...
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...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
In order to make a full evaluation of an interconnection network, it is essential to estimate the mi...
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 ...
It is well known that star graphs are strongly resilient like the n cubes 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 ...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
Determination of the minimum number of faulty links, f(n,k), that make every n-k-dimensional sub-sta...
The diameter of a network in the presence of faulty nodes is an important indicator of its resilienc...
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...