From subKautz digraphs to cyclic Kautz digraphs

Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, `) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family of subKautz digraphs sK(d, `), from where the cyclic Kautz digraphs can be obtained as line digraphs. This allows us to give exact formulas for the distance between any two vertices of both sK(d, `) and CK(d, `). Moreover, we compute the diameter and the semigirth of both families, also providing efficient routing algorithms to find the shortest path between any pair of vertices. Using these parameters, we also prove that sK(d, `) and CK(d, `) are maximally vertex-connected and super-edge-connected. Whereas K(d, `) are optimal with respect to the diameter, we show that sK(d, `) and CK(d, `) are optimal with respect to the mean distance, whose exact values are given for both families when ` = 3. Finally, we provide a lower bound on the girth of CK(d, `) and sK(d, `). Mathematics Subject Classifications: 05C20, 05C50.