Loading...
Loading...

Go to the content (press return)

From subKautz digraphs to cyclic Kautz digraphs

Author
Dalfo, C.
Type of activity
Report
Date
2017
Repository
http://hdl.handle.net/2117/105173 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". 2017.
Keywords
Diameter, Digraph, Distance, Girth, Kautz digraph, Line digraph, Mean distance, Routing, Semigirth, Superconnectivity, Vertex- and edge-connectivity
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments