Ninth International Conference on Parallel and Distributed Systems (ICPADS'02) Hamiltonian laceability on edge fault star graph Taiwan, ROC December 17-December 20 ISBN: 0-7695-1760-9
The star graph is an attractive alternative to the hypercube graph. It possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n -3)-edge fault tolerant hamiltonian laceable, (n -3)-edge fault tolerant strongly hamiltonian laceable, and (n -4)-edge fault tolerant hyper hamiltonian laceable. All these results are optimal in a sense described in this paper.
Index Terms:
star graph, hamiltonian laceable, strongly hamiltonian laceable, hyper hamiltonian laceable, fault tolerant.
Citation:
Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, "Hamiltonian laceability on edge fault star graph," icpads, pp.23, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb