✦ LIBER ✦

All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs

✍ Scribed by Hsu, C.-C.

Book ID: 114448234
Publisher: The Institution of Electrical Engineers
Year: 1996
Tongue: English
Weight: 621 KB
Volume: 143
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:19960245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quick recovery of two embedded complete

Quick recovery of two embedded complete binary trees in a hypercube

✍ Hsu, C.-C.; Liu, Y.-W. 📂 Article 📅 1994 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 567 KB

Embedding of complete binary tree with 2

Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube

✍ Jen-Chih Lin; Tzong-Heng Chi; Huan-Chao Keh; Ay-Hwa Andy Liou 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

Generation of all possible trees of a gr

Generation of all possible trees of a graph in independent groups

✍ R. Hashemian; M.S. Bakhtiar 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 268 KB

A special graph, the PS graph, is introduced and an algorithm is developed to generate all trees of such graphs. It is proved that for any given graph, G there exists certain number of PS graphs, obtained from G, such that the collection of all trees of all such PS graph span all trees of G with no