๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fault diameter of star graphs

โœ Scribed by Yordan Rouskov; Pradip K. Srimani

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
766 KB
Volume
48
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Conditional Fault Diameter of Star Graph
Conditional Fault Diameter of Star Graph Networks
โœ Yordan Rouskov; Shahram Latifi; Pradip K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 300 KB

It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults. We investigate star graphs under the conditions of forbidden faulty set

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

Highly Fault-Tolerant Routings and Fault
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs
โœ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ฯ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ฯ)/F, where