The hamiltonicity of WK-Recursive pyramid

Authors:
Yi-Chun Wang;Justie Su-Tzu Juan
Affiliations:
Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, R.O.C.;Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, R.O.C.
Venue:
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2012

Citing 5
Cited 0

Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
Shortest Paths in the Tower of Hanoi Graph and Finite Automata

SIAM Journal on Discrete Mathematics
Hierarchical WK-Recursive Topologies for Multicomputer Systems

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
The diameter of Hanoi graphs

Information Processing Letters
The triangular pyramid: Routing and topological properties

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fernandes and Kanevsky proposed an important structure in interconnection network, WKR Pyramid Networks (WKP(d, t, L), for short), in 1993. They are constructed by taking difference size WK-recursive network as difference layers. That paper discussed about the orders sizes and connectivity. WKP(d, L) is a simple version of WKP(d, t, L). In WKP(d, L), each vertex has exactly d children and the nth layer is isomorphic to a WK(d, n). In this paper, we show that WKP(d, L) is Hamiltonian-connected, for d≥3.