Connectivity of Kautz networks
type: Item
instance of: scholarly article
title: Connectivity of Kautz networks
zbMATH Open document ID: 0782.05053
DOI: 10.1016/0012-365X(93)90355-W
author: N. Homobono
author: Jean-Claude Bermond
author: Claudine Peyrat
published in: Discrete Mathematics
publication date: 1993-10-24T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 423564
zbMATH Keywords: Kautz graphs
zbMATH Keywords: connectivity
zbMATH Keywords: minimum degree
zbMATH Keywords: fault-tolerant networks
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q3941433
cites work: Large fault-tolerant interconnection networks
cites work: Q3834069
cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks
cites work: Q3688411
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Q3792715
cites work: A Design for Directed Graphs with Minimum Diameter
cites work: Connectivity of Regular Directed Graphs with Small Diameters
full work available at URL: 0012-365x(93)90355-w
OpenAlex ID: W2028396189
Recommended article: Connectivity for Kite-Linked Graphs
Recommended article: Q4305587
Recommended article: Connectivity of Communication Networks
Recommended article: Q4871749
Recommended article: Q3307704
Recommended article: Kirchhoff indexes of a network
Recommended article: On certain connectivity properties of the internet topology
Recommended article: Connectedness and its applications
Recommended article: Connectivity in finite ad-hoc networks
description: scientific article; zbMATH DE number 423564