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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berend, D., Sapir, A.: The diameter of hanoi graphs. Information Processing LetterĀ 98, 79ā85 (2006)
Buckley, F., Harary, F.: Distance in Graphs. Addisson-Wesley, Reading (1990)
Chen, G.H., Duh, D.R.: Topological properties, communication, and computation on wk-recursive network. NetworksĀ 24(6), 303ā317 (1994)
Fernandes, R.: Recursive interconnection networks for multicomputer networks. In: Proceedings of the 1992 International Conference on Parallel Processing, vol.Ā I, pp. 76ā79 (1992)
Fernandes, R., Kanevsky, A.: Hierarchical wk-recursive topologies for multicomputer systems. In: Proceedings of the 1993 International Conference on Parallel Processing, vol.Ā I, pp. 315ā318 (1993)
Fu, J.S., Chen, G.H.: Hamiltonicity of the hierarchical cubic network. Theory of Computing SystemsĀ 35(1), 59ā79 (2002)
Fu, J.-S.: Hamiltonicity of the wk-recursive network with and without faulty nodes. IEEE Transactions on Parallel and Distribured SystemsĀ 16(9), 853ā865 (2005)
Lu, X.M.: Towers of hanoi graphs. International Journal Computer MathematicsĀ 19, 23ā28 (1986)
Razavi, S., Sarbazi-Azad, H.: The triangular pyramid: Routing and topological properties. Information SciencesĀ 180, 2328ā2339 (2010)
Romik, D.: Shortest paths in the tower of hanoi graph and finite automata. SIAM Journal on Discrete MathematicĀ 20, 610ā622 (2003)
Zivkovic, D.: Hamiltonianicity of the tower of hanoi problem. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat.Ā 17, 31ā37 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, YC., Juan, J.ST. (2012). The Hamiltonicity of WK-Recursive Pyramid. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33065-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33065-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33064-3
Online ISBN: 978-3-642-33065-0
eBook Packages: Computer ScienceComputer Science (R0)