Connectivity of Kautz networks (Q685656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of Kautz networks |
scientific article |
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
