A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Fault tolerant token ring embedding in double loop networks
Information Processing Letters
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
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 Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian laceability on edge fault star graph
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
Embedding of cycles and grids in star graphs
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we investigate the star graph S"n with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of S"n, n=4, there is a fault-free path of length at least n!-2f"v-1, and there is a path of length at least n!-2f"v-2 joining a pair of vertices with the same color, when the number of faulty elements is n-3 or less. Here, f"v is the number of faulty vertices. S"n, n=4, with at most n-2 faulty elements has a fault-free cycle of length at least n!-2f"v unless the number of faulty elements are n-2 and all the faulty elements are edges incident to a common vertex. It is also shown that S"n, n=4, is strongly hamiltonian-laceable if the number of faulty elements is n-3 or less and the number of faulty vertices is one or less.