Abstract
We analyze some edge-fault-tolerant properties of the folded hypercube, which is a variant of the hypercube obtained by adding an edge to every pair of nodes with complementary address. We show that an n-dimensional folded hypercube is (n − 2)-edge-fault-tolerant Hamiltonian-connected when n( ≥ 2) is even, (n − 1)-edge-fault-tolerant strongly Hamiltonian-laceable when n( ≥ 1) is odd, and (n − 2)-edge-fault-tolerant hyper Hamiltonian-laceable when n( ≥ 3) is odd.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to the n-cube. In: Proceedings of International Conference on Parallel Processing, St. Charles, IL, pp. 555–556 (1987)
Akl, S.G.: Parallel Computation: Models and Methods. Prentice-Hall, Upper Saddle River (1997)
El-Amawy, A., Latifi, S.: Properties and performance of folded hypercubes. IEEE Transactions on Parallel and Distributed Systems 2, 31–42 (1991)
Ascheuer, N.: Hamiltonian path problems in the on-line optimization of flexible manufacturing systems. Ph.D. Thesis, University of Technology, Berlin, Germany (1995), also available from ftp://ftp.zib.de/pub/zib-publications/reports/TR-96-03.ps
Bermond, J.C. (ed.): “Interconnection networks,” a special issue of Discrete Applied Mathematics, vol. 37–38 (1992)
Bhuyan, L., Agrawal, D.P.: Generalized hypercubes and hyperbus structure for a computer network. IEEE Transactions on Computers 33, 323–333 (1984)
Esfahanian, A.H., Ni, L.M., Sagan, B.E.: The twisted n-cube with application to multiprocessing. IEEE Transactions on Computers 40, 88–93 (1991)
Fu, J.S., Chen, G.H.: Hamiltonicity of the hierarchical cubic network. Theory of Computing Systems 35, 59–79 (2002)
Hsu, D.F.: “Interconnection networks and algorithms,” a special issue of Networks 23(4) (1993)
Hsieh, S.Y., Chen, G.H., Ho, C.W.: Fault-free hamiltonian cycles in faulty arrangement graphs. IEEE Transactions on Parallel Distributed Systems 10, 223–237 (1999)
Hsieh, S.Y., Chen, G.H., Ho, C.W.: Hamiltonian-laceability of star graphs. Networks 36, 225–232 (2000)
Jwo, J.S., Lakshmivarahan, S., Dhall, S.K.: Embedding of cycles and grids in star graphs. Journal of Circuits, Systems, and Computers 1, 43–74 (1991)
Latifi, S., Zheng, S.Q., Bagherzadeh, N.: Optimal ring embedding in hypercubes with faulty links. In: Proceedings of the Twenty-Second Annual International Symposium on Fault-Tolerant Computing, Boston, Massachusetts, USA, pp. 178–184 (1992)
Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: Arrays· Trees· Hypercubes. Morgan Kaufmann, San Mateo (1992)
Lewinter, M., Widulski, W.: Hyper-Hamiltonian laceable and caterpillar-spannable product graphs. Computer and Mathematics with Applications 34, 99–104 (1997)
Preparata, F.P., Vuillemin, J.: The cube-connected cycles: a versatile network for parallel computation. Communication of the ACM 24, 300–309 (1981)
Simmons, G.: Almost all n-dimensional retangular lattices are Hamiltonian laceable. Congressus Numerantium 21, 103–108 (1978)
Tsai, C.-H., et al.: Fault-tolerant hamiltonian laceability of hypercubes. Information Processing Letters 83, 301–306 (2002)
Tsai, C.-H.: Linear array and ring embedding in conditional faulty hypercubes. Theoretical Computer Science 314, 431–443 (2004)
Wang, D.: Embedding Hamiltonian cycles into folded hypercubes with faulty links. Journal of Parallel and Distributed Computing 61, 545–564 (2001)
West, D.B.: Introduction to Graph Theory. Prentice-Hall, Upper Saddle River (2001)
Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)
Xu, J.: Cycles in folded hypercubes. Applied Mathematics Letters 19, 140–145 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsieh, SY. (2007). Path Embedding on Folded Hypercubes. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)