Generalized de Bruijn digraphs
- 1 March 1988
- Vol. 18 (1) , 27-38
- https://doi.org/10.1002/net.3230180105
Abstract
We show that the digraphs proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to minimize diameters essentially retain all the nice properties of de Bruijn digraphs and yet are applicable to any number of nodes. In particular we give results on the number of loops, the link connectivities and connectivities, the embedding properties and the self‐routing properties for these digraphs.Keywords
This publication has 7 references indexed in Scilit:
- Fault-Tolerant Routing in DeBruijn Comrnunication NetworksIEEE Transactions on Computers, 1985
- Doubly Linked Ring NetworksIEEE Transactions on Computers, 1985
- Connectivity of Regular Directed Graphs with Small DiametersIEEE Transactions on Computers, 1985
- A Design for Directed Graphs with Minimum DiameterIEEE Transactions on Computers, 1983
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- Design to Minimize Diameter on Building-Block NetworkIEEE Transactions on Computers, 1981
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971