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

DOI10.1002/net.22177zbMath1530.05063arXiv2203.09918OpenAlexW4385380522MaRDI QIDQ6180036

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

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09918

zbMATH Keywords

interconnection networksdirected graphsKautz digraphsDe Bruijn digraphsdeflection routinggraphs on alphabets

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing
• Graphs on alphabets as models for large interconnection networks
• Large generalized cycles
• On the power domination number of de Bruijn and Kautz digraphs
• Distance domination of generalized de Bruijn and Kautz digraphs
• Iterated line digraphs are asymptotically dense
• Line Digraph Iterations and the (d, k) Digraph Problem
• Mean eccentricities of de Bruijn networks
• On a lightwave network topology using Kautz digraphs
• Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs

This page was built for publication: Distance‐layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing