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

Gossiping and routing in second-kind Frobenius graphs

โœ Scribed by Xin Gui Fang; Sanming Zhou

Book ID
113582463
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
295 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Gossiping and routing in undirected trip
Gossiping and routing in undirected triple-loop networks
โœ Alison Thomson; Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 194 KB

Given integers n โ‰ฅ 7 and a, b, c with 1 โ‰ค a, b, c โ‰ค n -1 such that a, na, b, nb, c, nc are pairwise distinct, the (undirected) triple-loop network TL n (a, b, c) is the degree-six graph with vertices 0, 1, 2, . . . , n -1 such that each vertex x is adjacent to x ยฑ a, x ยฑ b, and x ยฑ c, where the oper

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