Skip to main content
SpringerLink
Log in

On the multiply-twisted hypercube

  • Conference paper
  • First Online:
Parallel and Distributed Computing Theory and Practice (CFCP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 805))

Included in the following conference series:

  • 172 Accesses

Abstract

In this paper, we prove that the multiply-twisted hypercube is a Cayley graph and hence it possesses the desirable properties such as vertex symmetry, optimal fault tolerance, and small node degree. We also prove the conjecture that the 2n−1 node complete binary tree is a subgraph of the 2n node multiply twisted hypercube.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Abuelrub and S. Bettayeb, “Embedding of Complete Binary trees into Twisted Hypercubes” Proceedings of the International Conference on Computer Applications in Design, Simulation and Analysis, 1993, pp 1–4.

    Google Scholar 

  2. S. B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks” IEEE Trans. on Computers, Vol. 38, No. 4, April 1989, pp 555–566.

    Google Scholar 

  3. S. Bhatt and I. Ipsen, “How to embed trees in Hypercubes” Research Report 443, Dept. of Computer Science, Yale University, 1985.

    Google Scholar 

  4. K. Efe, “The Crossed Cube Architecture for Parallel Computing” IEEE Trans. on Parallel and Distributed Systems, Vol. 3, No. 5, September 1992, pp 513–524.

    Google Scholar 

  5. A. H. Esfahanian, Lional M. Ni, and Bruce E. Sagan, “The Twisted N-Cube with Application to Multiprocessing” IEEE Trans. on Computers, Vol. 40, No. 1, January 1991, pp 88–93.

    Google Scholar 

  6. D. P. Kulasinghe and S. Bettayeb, “Cayley Graph Representation of the Multiply-Twisted Hypercube” Tech. Rept. No. TR# 93-006, Department of Computer Science, Louisiana State University, Baton Rouge.

    Google Scholar 

  7. C. C. Pinter, “A Book of Abstract Algebra” McGraw-Hill Publishing Company, 1990.

    Google Scholar 

  8. S. Q. Zheng, “SIMD Data Communication Algorithms for Multiply Twisted Hypercube” Proceedings of the 5th IEEE International Parallel Proc. Symposium, 1991, pp 120–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Elect. & Comp. Engineering, Louisiana State University, 70803, Baton Rouge, LA

    Priyalal Kulasinghe

  2. Department of Computer Science, Louisiana Sate University, 70803, Baton Rouge, LA

    Said Bettayeb

Authors
  1. Priyalal Kulasinghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Said Bettayeb
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Cosnard Afonso Ferreira Joseph Peters

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kulasinghe, P., Bettayeb, S. (1994). On the multiply-twisted hypercube. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-58078-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58078-2

  • Online ISBN: 978-3-540-48435-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation