The undirected de Bruijn graph: fault tolerance and routing algorithms

DOI10.1109/81.109242zbMATH Open0776.05042OpenAlexW2118433864MaRDI QIDQ4005145FDOQ4005145

Authors: M. A. Sridhar 

Publication date: 27 September 1992

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 1008455
• Wide diameters of de Bruijn graphs
• scientific article; zbMATH DE number 640491
• A new property of binary undirected de Bruijn graphs
• Publication:4488861

zbMATH Keywords

diameterfault toleranceinterconnection networkde Bruijn graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: The undirected de Bruijn graph: fault tolerance and routing algorithms

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