✦ LIBER ✦

Combinatorial analysis of the fault-diameter of the n-cube

✍ Scribed by Latifi, S.

Book ID: 119771888
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 692 KB
Volume: 42
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.192211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault diameter of k-ary n-cube networks

✍ Day, K.; Al-Ayyoub, A.E. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 172 KB

Combinatorial Structure of the Faces of

Combinatorial Structure of the Faces of the n -Cube

✍ Metropolis, N.; Rota, Gian-Carlo 📂 Article 📅 1978 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 749 KB

Combinatorial Structure of the Faces of

Combinatorial Structure of the Faces of the n-Cube

✍ N. Metropolis and Gian-Carlo Rota 📂 Article 📅 1978 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 666 KB

Orientations of the n-cube with minimum

Orientations of the n-cube with minimum diameter

✍ Joseph E. McCanna 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 368 KB

For n 3 4, the n-cube, Q,, is shown to have an orientation with diameter n.

The vulnerability of the diameter of fol

The vulnerability of the diameter of folded n-cubes

✍ E. Simó; J.L.A. Yebra 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Fault tolerance concern in the design of interconnection networks has arisen interest in the study of graphs such that the subgraphs obtained by deleting some vertices or edges have a moderate increment of the diameter. Besides the general problem, several particular families of graphs are worthy of

The diameter of the cube-connected cycle

The diameter of the cube-connected cycles

✍ Ivan Friš; Ivan Havel; Petr Liebl 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers.