๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fault-tolerant hamiltonian laceability of hypercubes

โœ Scribed by Chang-Hsiung Tsai; Jimmy J.M. Tan; Tyne Liang; Lih-Hsing Hsu

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
98 KB
Volume
83
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamiltonian-connectivity and strongly Ha
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
โœ Sun-Yuan Hsieh; Che-Nan Kuo ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 302 KB

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded

Fault-Tolerant Multicasting on Hypercube
Fault-Tolerant Multicasting on Hypercubes
โœ A.C. Liang; S. Bhattacharya; W.T. Tsai ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 912 KB

Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a \(d\) dimensional binary hypercube in the presence of \(F\) link failures, where \(F<d\). We develop a fault-tolerant (FT) multicast

Hamiltonian-laceability of star graphs
Hamiltonian-laceability of star graphs
โœ Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views