✦ LIBER ✦

On the k-ary hypercube

✍ Scribed by Saïd Bettayeb

Book ID: 107948797
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 462 KB
Volume: 140
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00197-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding K-ary Complete Trees into Hype

Embedding K-ary Complete Trees into Hypercubes

✍ X.J. Shen; Q. Hu; W.F. Liang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 529 KB

The cost of broadcasting on star graphs

The cost of broadcasting on star graphs and k-ary hypercubes

✍ Graham, S.W.; Seidel, S.R. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 487 KB

Edge disjoint Hamiltonian cycles in k-ar

Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes

✍ Bae, M.M.; Bose, B. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 580 KB

Deadlock-free routing in k-ary hypercube

Deadlock-free routing in k-ary hypercube network in presence of processor failures

✍ A. Sengupta; S. Bandyopadhyay 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 574 KB

On k-detour subgraphs of hypercubes

✍ Nana Arizumi; Peter Hamburger; Alexandr Kostochka 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A spanning subgraph __G__ of a graph __H__ is a __k__‐__detour subgraph__ of __H__ if for each pair of vertices $x,y \in V(H)$, the distance, ${\rm dist}\_G(x,y)$, between __x__ and __y__ in __G__ exceeds that in __H__ by at most __k__. Such subgraphs sometimes also are called __additiv

Embedding ofk-ary Complete Trees into Hy

Embedding ofk-ary Complete Trees into Hypercubes with Uniform Load

✍ Jan Trdlička; Pavel Tvrdı&#x0301;k 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 411 KB