Fault-Tolerant Routing in DeBruijn Comrnunication Networks
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
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Fault-tolerant multicasting on hypercubes
Journal of Parallel and Distributed Computing
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
Conditional fault diameter of star graph networks
Journal of Parallel and Distributed Computing
Efficient gossiping by packets in networks with random faults
SIAM Journal on Discrete Mathematics
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Longest fault-free paths in star graphs with vertex faults
Theoretical Computer Science
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
SIAM Journal on Discrete Mathematics
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault tolerance in bubble-sort graph networks
Theoretical Computer Science
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Fault tolerance in k-ary n-cube networks
Theoretical Computer Science
Hi-index | 5.23 |
The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two or more fault-free links, we show that an n-dimensional star network can tolerate up to 2n-7 link faults, and be strongly (fault-free) Hamiltonian laceable, where n=4. In other words, we can embed a fault-free linear array of length n!-1 (n!-2) in an n-dimensional star network with up to 2n-7 link faults, if the two end nodes belong to different partite sets (the same partite set). The result is optimal with respect to the number of link faults tolerated. It is already known that under the random fault model, an n-dimensional star network can tolerate up to n-3 faulty links and be strongly Hamiltonian laceable, for n=3.