Connectivity of Kautz networks (Q685656): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large fault-tolerant interconnection networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3834069 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3688411 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Line Digraph Iterations and the (d, k) Digraph Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3792715 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity of Regular Directed Graphs with Small Diameters / rank | |||
Normal rank | |||
Revision as of 10:55, 22 May 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
