Fault-Tolerant Routing in DeBruijn Comrnunication 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
Efficient gossiping by packets in networks with random faults
SIAM Journal on Discrete Mathematics
Parallel computation: models and methods
Parallel computation: models and methods
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Longest fault-free paths in star graphs with vertex faults
Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
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
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
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-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Hamiltonicity of a general OTIS network
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
| Hi-index | 0.00 |
The star graph possesses many nice topological properties. In this study, we show that for any n-dimensional star graph (n=4) with =