Fault-tolerant networks based on the de Bruijn graph

DOI10.1109/12.93750zbMath1395.68065OpenAlexW2115670901MaRDI QIDQ5375420

M. A. Sridhar, Cauligi S. Raghavendra

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.93750

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

\(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\) ⋮ New classes of perfect maps. I ⋮ Möbius-deBruijn: the product of Möbius cube and deBruijn digraph ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions

This page was built for publication: Fault-tolerant networks based on the de Bruijn graph