Loading...
Loading...

Go to the content (press return)

From subkautz digraphs to cyclic kautz digraphs

Author
Dalfo, C.
Type of activity
Journal article
Journal
Journal of interconnection networks
Date of publication
2018-06-01
Volume
18
Number
2-3
First page
1
Last page
16
DOI
https://doi.org/10.1142/S0219265918500068 Open in new window
Project funding
Combinatorics of networks and computation
Combinatòria, Teoria de Grafs i Aplicacions
Repository
http://hdl.handle.net/2117/125611 Open in new window
URL
https://www.worldscientific.com/doi/abs/10.1142/S0219265918500068 Open in new window
Abstract
Kautz digraphs K(d,l) 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,l) 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,l), from where the cyclic Kautz digraphs can be obtained as line digraphs. Th...
Citation
Dalfo, C. From subkautz digraphs to cyclic kautz digraphs. "Journal of interconnection networks", 1 Juny 2018.
Keywords
(Vertex-)connectivity, Diameter, Digraph, Distance, Edge-connectivity, Girth, Kautz digraph, Line digraph, Mean distance, Routing, Semigirth, Superconnectivity
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments