Abstract
By means of analysis and generalization of the hypercube and its variations of the same topological properties and network parameters, a family of interconnection networks, referred to as binary recursive networks, is introduced in this paper. This kind of networks not only provides a powerful method to investigate the hypercube and its variations on the whole, but also puts forth an effective tool to explore new network structures. A constructive proof is presented to show that binary recursive networks are Hamiltonian based on their recursive structures, and an approach to prove 4-pancyclicity of a subfamily of binary recursive networks is outlined.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. The Macmillan Press Ltd, NYC (1976)
Chedid, F.B., Chedid, R.B.: A new variation on hypercubes with smaller diameter. Infromation Processing Letters 46, 275–280 (1993)
Cull, P., Larson, S.M.: The Möbius cubes. IEEE Trans. Computers 44(5), 647–659 (1995)
Efe, K.: A Variation on the Hypercube with Lower Diameter. IEEE Trans. On Computers 40(11), 1312–1316 (1991)
Efe, K.: The crossed cube architecture for parallel computation. IEEE Trans. Parallel and Distributed Systems 3(5), 513–524 (1992)
Esfahanian, A., Ni, L.M., Sagan, B.E.: The twisted n-cube with application to multiprocessing. IEEE Trans. Computers 40(1), 88–93 (1991)
Gould, R.J.: Updating the hamiltonian problem – a survey. J. Graph Theory 15(2), 121–157 (1991)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Array, Tree, Hypercubes. Morgan Kaufmann, San Mateo, Calif (1992)
Park, C., Chwa, K.: Hamiltonian properties on the class of hypercube-like networks. Information Processing Letters 91, 11–17 (2004)
Rowley, R.A., Bose, B.: Fault-tolerant ring embedding in de Bruijn Networks. IEEE Trans. Comput. 42(12), 1480–1486 (1993)
Saad, Y., Schultz, M.: Topological properties of hypercube. IEEE Trans. Computers 37(7), 867–872 (1988)
Hsieh, S., Chen, G., Ho, C.: Fault-free Hamiltonian cycles in faulty arrangement graphs. IEEE Trans. Parallel and Distributed Systems 10(3), 223–237 (1999)
West, D.B.: Introduction to graph theory. PrenticeHall, Englewood Cliffs (1996)
Wang, D., Zhao, L.: The twisted-cube connected network. J. of Computer Science and Technology 14(2), 181–187 (1999)
Wang, D., An, T., Pan, M., et al.: Hamiltonian-like properties of k-ary n-cubes. In: The Proceeding of International Conference on Parallel and Distributed Computing, pp. 1002–1007 (2005)
Hu, K.S., Yeoh, S., Chen, C., Hsu, L.: Node-pancyclicity and edge-pancyclicity of hypercube variants. Information Processing Letters 102, 1–3 (2007)
Wang, D., Liu, Y.: Almost Pancyclic Property of the Twisted-Cube Connected Network. Chinese Journal of Northeastern University(Natural Science) 20(1), 12–14 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Y., Li, Z., Wang, D. (2007). Hamiltonicity and Pancyclicity of Binary Recursive Networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)