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

Connectivity of kautz networks

โœ Scribed by J.-C. Bermond; N. Homobono; C. Peyrat

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
720 KB
Volume
114
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We show that undirected Kautz graphs (Theorem 3.1) and modified Kautz graphs (Theorem 4.2) have their connectivities equal to their minimum degrees. In view of their other properties, these results show that Kautz graphs are very good fault-tolerant networks.

๐Ÿ“œ SIMILAR VOLUMES

De Bruijn and Kautz bus networks
De Bruijn and Kautz bus networks
โœ Bermond, Jean-Claude; Dawes, Robin W.; Ergincan, Fahir ๏ฟฝ. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 598 KB

Our aim was to find bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus, and the network diameter. Point-to-point networks are a special case of bus networks in which every bus

A unified formulation of Kautz network a
A unified formulation of Kautz network and generalized hypercube
โœ S. Zhou; H. Xu; W. Xiao ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB

Hypercube and Kautz network each possess certain desirable properties. However, some of the attractive features of one network are not found in the other. A novel class of network topologies proposed in this paper has the generalized hypercube and the Kautz network as its two extremes, The proposed

Connectivity in random networks
Connectivity in random networks
โœ Derek F. Stubbs; Phillip I. Good ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Springer ๐ŸŒ English โš– 471 KB
Connectivity change in habitat networks
Connectivity change in habitat networks
โœ Timothy C. Matisziw; Alan T. Murray ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 467 KB