Connectivity of Kautz networks (Q685656): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90355-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028396189 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 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
