loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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
ASCII Text
x 
 
Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, "Hamiltonian laceability on edge fault star graph," Parallel and Distributed Systems, International Conference on, pp. 23, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/ICPADS.2002.1183373,
author = {Tseng-Kuei Li and Jimmy J. M. Tan and Lih-Hsing Hsu},
title = {Hamiltonian laceability on edge fault star graph},
journal ={Parallel and Distributed Systems, International Conference on},
volume = {0},
year = {2002},
issn = {1521-9097},
pages = {23},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2002.1183373},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Systems, International Conference on
TI - Hamiltonian laceability on edge fault star graph
SN - 1521-9097
SP
EP
A1 - Tseng-Kuei Li,
A1 - Jimmy J. M. Tan,
A1 - Lih-Hsing Hsu,
PY - 2002
KW - star graph
KW - hamiltonian laceable
KW - strongly hamiltonian laceable
KW - hyper hamiltonian laceable
KW - fault tolerant.
VL - 0
JA - Parallel and Distributed Systems, International Conference on
ER -
 
Tseng-Kuei Li, Ching Yun Institute of Technology
Jimmy J. M. Tan, National Chiao Tung University
Lih-Hsing Hsu, National Chiao Tung University
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.