✦ LIBER ✦

Fault Tolerance of Cayley Graphs

✍ Scribed by Shuhong Gao; Beth Novick

Publisher: Springer
Year: 2007
Tongue: English
Weight: 145 KB
Volume: 11
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-007-0312-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault-tolerant broadcast graphs

✍ Arthur L. Liestman 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB

Node fault tolerance in graphs

✍ Harary, Frank; Hayes, John P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB 👁 2 views

A graph G \* is a k-node fault-tolerant supergraph of a graph G , denoted k-NFT( G), if every graph obtained by removing k nodes from G\* contains G. A k-NFT(G) graph G\* is said to be optimal if it contains n + k nodes, where n is the number of nodes of G and G \* has the minimum number of edges am

Edge fault tolerance in graphs

✍ Frank Harary; John P. Hayes 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

Fault-tolerant graphs for tori

✍ Yamada, Toshinori; Ueno, Shuichi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 2 views

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number D(t, H) of edges such that even after deleting any t edges from G the remaini

Minimized embedding of arbitrary hamilto

Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids andk-fault-tolerance

✍ M. F. Karavai 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 288 KB

Faithful 1-edge fault tolerant graphs

✍ Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

A graph G\* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G' contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can