✦ LIBER ✦

Edge fault tolerance in graphs

✍ Scribed by Frank Harary; John P. Hayes

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 628 KB
Volume: 23
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230230207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Edge-fault-tolerant pancyclicity of alte

Edge-fault-tolerant pancyclicity of alternating group graphs

✍ Ping-Ying Tsai; Gen-Huey Chen; Jung-Sheng Fu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 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

Fault-tolerant broadcast graphs

✍ Arthur L. Liestman 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 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

Cluster fault-tolerant routing in star g

Cluster fault-tolerant routing in star graphs

✍ Gu, Qian-Ping; Peng, Shietung 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Fault-tolerant routing is a key issue in computer/ communication networks. We say a network (graph) can tolerate l faulty nodes for a routing problem if after removing at most l arbitrary faulty nodes from the graph the routing paths exist for the routing problem. However, the bound l is usually a w