scientific article

zbMATH Open0762.94015MaRDI QIDQ4035366FDOQ4035366

Dhiraj K. Pradhan

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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)

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

   Recommendations

• A VLSI decomposition of the deBruijn graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Some VLSI decompositions of the de Bruijn graph 👍 👎
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks 👍 👎

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)