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

DOI10.1016/J.ENDM.2016.09.028zbMATH Open1356.05057OpenAlexW2536686361MaRDI QIDQ510568FDOQ510568

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

Recommendations

• De Bruijn and Kautz digraphs of a rooted tree
• Asymptotically optimal \((\Delta, D', s)\)-digraphs
• Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
• scientific article; zbMATH DE number 4055643
• Bisecting de Bruijn and Kautz graphs

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)

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510568)