World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

From Subkautz Digraphs to Cyclic Kautz Digraphs*

    The Kautz digraphs K(d, ) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to 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 the cyclic Kautz digraphs by introducing the family of the 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, ).

    * This research have been partially supported by the Agency for Management of University and Research Grants of Catalonia (AGAUR) under project 2017SGR1087.