Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951990 | Theoretical Computer Science | 2017 | 10 Pages |
Abstract
The Kautz graphs are a famous class of network models and the super-λ property of graphs is a good indicator of the fault tolerance of networks. We, in this paper, study mainly the conditional arc connectivity and super-λ tolerance to arc-faults of digraphs, which are two measurements of super-λ property. We first give some bounds on them in terms of minimum degree of digraphs, and then determine them for Kautz digraphs. The obtained results show that the fault tolerance of Kautz networks is nice.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Shangwei Lin, Chanchan Zhou, Chunfang Li,