scientific article; zbMATH DE number 176259

MaRDI QIDQ4035366zbMATH OpenFDO

Authors Dhiraj K. Pradhan

Publication date 18 May 1993

zbMATH Keywords

networksde Bruijn graphsfault-tolerant designshuffle-exchangebinary cube

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A VLSI decomposition of the deBruijn graph
• Publication:4488861
• scientific article; zbMATH DE number 1008455
• Some VLSI decompositions of the de Bruijn graph
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks

Cited in

(5)

• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• The bondage numbers of extended de Bruijn and Kautz digraphs
• The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
• Some VLSI decompositions of the de Bruijn graph
• On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs

This page was built for publication:

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