Carregant...
Carregant...

Vés al contingut (premeu Retorn)

From subKautz digraphs to cyclic Kautz digraphs

Autor
Dalfo, C.
Tipus d'activitat
Document cientificotècnic
Data
2017
Repositori
http://hdl.handle.net/2117/105173 Obrir en finestra nova
Resum
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...
Citació
Dalfo, C. "From subKautz digraphs to cyclic Kautz digraphs". 2017.
Paraules clau
Digraph, Distance, Diameter, Mean Distance, Routing, Kautz Digraph, Line Digraph, Vertex- And Edge-connectivity, Superconnectivity, Semigirth, Girth
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius