On the diameter vulnerability of Kautz digraphs.
Journal
Discrete Mathematics
Journal Volume
151
Journal Issue
1-3
Pages
81-85
Date Issued
1996
Author(s)
Abstract
We show that in the Kautz digraph K(d,t) with dt + dt-1 vertices each having out degree d, there exist d vertex-disjoint paths between any pair of distinct vertices, one of length at most t, d - 2 of length at most t + 1, and one of length at most t + 2.
Type
journal article