Logo image
Fault-tolerant ring embedding in star graphs
Conference paper

Fault-tolerant ring embedding in star graphs

Yu-Chee Tseng, Shu-Hui Chang and Jang-Ping Sheu
IEEE Symposium on Parallel and Distributed Processing - Proceedings, pp.660-665
1996

Abstract

In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with f e ≤ n - 3 faulty links a Hamiltonian cycle still can be found in an n-star, and that with f v ≤ n - 3 faulty nodes a ring containing at most 4f v nodes less than that in a Hamiltonian cycle can be found (i.e., containing at least n! - 4f v nodes). In general, in an n-star with f e faulty links and f v faulty nodes, where f e + f v ≤ n - 3, our embedding is able to establish a ring containing at least n! - 4f v nodes.

Metrics

1 Record Views

Details

Logo image