Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing

DOI10.1016/J.ENDM.2016.09.028zbMath1356.05057OpenAlexW2536686361MaRDI QIDQ510568

J. Fàbrega, Xavier Muñoz, Jaume Martí-Farré

Publication date: 13 February 2017

Full work available at URL: http://hdl.handle.net/2117/103040

zbMATH Keywords

Kautz digraphsDe Bruijn digraphsdeflection routinggeneral iterated line digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing

Cites Work

• Graphs on alphabets as models for large interconnection networks
• Large generalized cycles
• Line Digraph Iterations and the (d, k) Digraph Problem

This page was built for publication: Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing