We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance.
- Authors
Y-Chuang Chen; Yong-Zen Huang; Lih-Hsing Hsu; Jimmy J. M. Tan
- Abstract
Processor (vertex) faults and link (edge) faults may happen when a network is used, and it is meaningful to consider networks ( graphs) with faulty processors and/or links. A k-regular Hamiltonian and Hamiltonian connected graph G is optimal fault-tolerant Hamiltonian and Hamiltonian connected if G remains Hamiltonian after removing at most k−2 vertices and/or edges and remains Hamiltonian connected after removing at most k−3 vertices and/or edges. In this paper, we investigate in constructing optimal fault-tolerant Hamiltonian and optimal fault-tolerant Hamiltonian connected graphs. Therefore, some of the generalized hypercubes, twisted-cubes, crossed-cubes, and Möbius cubes are optimal fault-tolerant Hamiltonian and optimal fault-tolerant Hamiltonian connected.
- Subjects
MICROPROCESSORS; GRAPH theory; SYSTEMS design; RELIABILITY in engineering; FAULT-tolerant computing
- Publication
Journal of Supercomputing, 2010, Vol 54, Issue 2, p229
- ISSN
0920-8542
- Publication type
Article
- DOI
10.1007/s11227-009-0316-3