Connectivity of Kautz networks (Q685656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectivity of Kautz networks |
scientific article; zbMATH DE number 423564
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of Kautz networks |
scientific article; zbMATH DE number 423564 |
Statements
Connectivity of Kautz networks (English)
0 references
24 October 1993
0 references
The authors show that the so-called Kautz graphs have their connectivity equal to their minimum degree. Thanks to their other properties, the result makes them suitable for fault-tolerant networks.
0 references
Kautz graphs
0 references
connectivity
0 references
minimum degree
0 references
fault-tolerant networks
0 references
0 references
0 references
0 references
0.8414986
0 references
0 references
0.83965594
0 references
