The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with <it>f</it><sub><it>e</it></sub>≤<it>n</it>− 3 faulty links, a Hamiltonian cycle still can be found in an <it>n</it>-star, and that with <it>f</it><sub><it>v</it></sub>≤<it>n</it>− 3 faulty nodes, a ring containing at most 4<it>f</it><sub><it>v</it></sub> nodes less than that in a Hamiltonian cycle can be found (i.e., the ring contains at least <it>n</it>! − 4<it>f</it><sub><it>v</it></sub> nodes). In general, in an <it>n</it>-star with <it>f</it><sub><it>e</it></sub> faulty links and <it>f</it><sub><it>v</it></sub> faulty nodes, where <it>f</it><sub><it>e</it></sub> + <it>f</it><sub><it>v</it></sub>≤<it>n</it>− 3, our embedding is able to establish a ring containing at least <it>n</it>! − 4<it>f</it><sub><it>v</it></sub> nodes.</p>
Fault tolerance, graph embedding, Hamiltonian cycle, interconnection network, processor allocation, ring, star graph.

J. Sheu, S. Chang and Y. Tseng, "Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1185-1195, 1997.
89 ms
(Ver 3.3 (11022016))