Transputer reference manual
A recursively scalable network VLSI implementation
Future Generation Computer Systems
An optimized broadcasting technique for WK-Recursive topologies
Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topological properties of WK-recursive networks
Journal of Parallel and Distributed Computing
A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
Broadcasting on incomplete WK-recursive networks
Journal of Parallel and Distributed Computing
Node-disjoint paths in incomplete WK-recursive networks
Parallel Computing - special issue on parallel computing for irregular applications
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing and Broadcasting in Recursive Interconnection Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
The triangular pyramid: Routing and topological properties
Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
The recursive network-based routing algorithm
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Many-to-many n-disjoint path covers in n-dimensional hypercubes
Information Processing Letters
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
Shortest paths in Sierpiński graphs
Discrete Applied Mathematics
| Hi-index | 0.07 |
A graph G is said to be Hamiltonian-connected if there is a Hamiltonian path between every two distinct nodes of G. Let F denote the set of faulty nodes of G. Then, G is |F|-node Hamiltonian-connected if G-F is Hamiltonian-connected. We use K(d,t) to denote a WK-recursive network of level t, each of whose basic modules is a d-node complete graph. Compared with other networks, it is rather difficult to construct a Hamiltonian path between two arbitrary nodes in a faulty WK-recursive network. In this paper, we show that K(d,t) is (d-4)-node Hamiltonian-connected. Since the connectivity of K(d,t) is d-1, the result is optimal in the worst case.