✦ LIBER ✦

On Group Graphs and Their Fault Tolerance

✍ Scribed by Akers, S.B.; Krishnamurthy, B.

Book ID: 114607073
Publisher: IEEE
Year: 1987
Tongue: English
Weight: 864 KB
Volume: C-36
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1987.1676983

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault tolerance of edge pancyclicity in

Fault tolerance of edge pancyclicity in alternating group graphs

✍ Andrzej Szepietowski 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 444 KB

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

Minimized Embedding of Arbitrary Hamilto

Minimized Embedding of Arbitrary Hamiltonian Graphs in Fault-tolerant Graph and Reconfiguration at Faults. I. One-fault-tolerant Structures

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

Edge fault tolerance in graphs

✍ Frank Harary; John P. Hayes 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 628 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

An optimal result on fault-tolerant cycl

An optimal result on fault-tolerant cycle-embedding in alternating group graphs

✍ Zhan-jun Xue; San-yang Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 259 KB