Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Fault-tolerant multiprocessor and VLSI-based system communication architectures
Fault-tolerant computing: theory and techniques; Vol. 2
Double loop networks with minimum delay
Discrete Mathematics
Design to Minimize Diameter on Building-Block Network
IEEE Transactions on Computers
A Design for Directed Graphs with Minimum Diameter
IEEE Transactions on Computers
The Hamiltonian property of consecutive-d digraphs
Mathematical and Computer Modelling: An International Journal
The hamiltonian property of the consecutive-3 digraph
Mathematical and Computer Modelling: An International Journal
Note: Hamiltonicity of large generalized de Bruijn cycles
Discrete Applied Mathematics
| Hi-index | 0.00 |
Consider a digraph G(n, q, r) with n nodes and n links i - qi + r, i = 0, 1,..., n - 1, where q and r are given. The topologies of many computer networks use G(n, q, r) as basic building block. A digraph is called Hamiltonian if it contains a circuit spanning all nodes. The Hamiltonian property of a network topology provides the capability of configuring the interconnection network as a linear array, which is the configuration with the broadest practical significance, of either n - 1 or n nodes in the presence of a single faulty node or link. In this paper we give necessary and sufficient conditions for G(n, q, r) to be Hamiltonian.