A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs

DOI10.1016/S0166-218X(96)00130-8zbMath0878.05041OpenAlexW2039773446MaRDI QIDQ1364476

Marie-Claude Heydemann, Dominique Barith

Publication date: 18 December 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

line digraphKautz digraph\(k\)-factorsgeneralized de Bruijn digraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ On total regularity of mixed graphs with order close to the Moore bound ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fault-tolerant routings in Kautz and de Bruijn networks
• A new look at the de Bruijn graph
• The underlying graph of a line digraph
• Methods and problems of communication in usual networks
• Line Digraph Iterations and the (d, k) Digraph Problem
• Group Action Graphs and Parallel Architectures
• Generalized de Bruijn digraphs
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Design to Minimize Diameter on Building-Block Network
• A Scheme for Fast Parallel Communication
• On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs

This page was built for publication: A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs