Connectivity of Kautz networks (Q685656): Difference between revisions

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

zbMATH Keywords

Kautz graphs

0 references

connectivity

0 references

minimum degree

0 references

fault-tolerant networks

0 references

reviewed by

Peter Horák

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3941433

0 references

Large fault-tolerant interconnection networks

0 references

Q3834069

0 references

Fault-Tolerant Routing in DeBruijn Comrnunication Networks

0 references

Q3688411

0 references

Line Digraph Iterations and the (d, k) Digraph Problem

0 references

Q3792715

0 references

A Design for Directed Graphs with Minimum Diameter

0 references

Connectivity of Regular Directed Graphs with Small Diameters

0 references

full work available at URL

https://doi.org/10.1016/0012-365x(93)90355-w

0 references

Identifiers

zbMATH Open document ID

0782.05053

0 references

DOI

10.1016/0012-365X(93)90355-W

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:685656

@@ Property / author @@
+Jean-Claude Bermond
@@ Property / author: Jean-Claude Bermond / rank @@
+Normal rank
@@ Property / author @@
+Claudine Peyrat
@@ Property / author: Claudine Peyrat / rank @@
+Normal rank
@@ Property / reviewed by @@
+Peter Horák
@@ Property / reviewed by: Peter Horák / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Large fault-tolerant interconnection networks
@@ Property / cites work: Large fault-tolerant interconnection networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3834069
@@ Property / cites work: Q3834069 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-Tolerant Routing in DeBruijn Comrnunication Networks
+Normal rank
@@ Property / cites work @@
+Q3688411
@@ Property / cites work: Q3688411 / rank @@
+Normal rank
@@ Property / cites work @@
+Line Digraph Iterations and the (d, k) Digraph Problem
+Normal rank
@@ Property / cites work @@
+Q3792715
@@ Property / cites work: Q3792715 / rank @@
+Normal rank
@@ Property / cites work @@
+A Design for Directed Graphs with Minimum Diameter
+Normal rank
@@ Property / cites work @@
+Connectivity of Regular Directed Graphs with Small Diameters
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(93)90355-w
+Normal rank
@@ Property / OpenAlex ID @@
+W2028396189
@@ Property / OpenAlex ID: W2028396189 / rank @@
+Normal rank