On group graphs and their fault tolerance
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Near-optimal message routing and broadcasting in faulty hypercubes
International Journal of Parallel Programming
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
Cyclic vertex connectivity of star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
| Hi-index | 0.00 |
Fault tolerance capability is one of the advantages of multiprocessor systems. We prove that the fault tolerance of star graphs is 2n-5 with restriction to the forbidden faulty set. We propose an algorithm for examining the connectivity of star graphs when 2n-4 faults exist. The algorithm requires O(n/sup 3/ logn) time. We also improve the fault-tolerant routing algorithm proposed by Bagherzadeh et al. (1993) by calculating the cycle structure of a permutation and the avoidance of routing messages to a node without another nonfaulty neighbor. This calculation needs only constant time. We propose an efficient fault-tolerant broadcasting algorithm. When no fault occurs, our broadcasting algorithm remains optimal. The penalty is O(n/sup 2/) if at most n-2 faults exist.