Skip to main content
Log in

Permutation-exchange graphs that emulate the binary cube

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The concept of permutation-exchange graph is introduced to generalize the well known shuffle-exchange graph. A complete characterization of the permutations that give rise to emulators of the cube is also found, and it is shown that all these permutations are closely related to the shuffle.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Stone, H. S., Parallel processing with the perfect shuffle.IEEE Trans. Comput. C-20, 2, (Feb. 1971) 153–161.

  2. Pease, M. C., The indirect binaryn-cube microprocessor array.IEEE Trans. Comput. C-26, 5, (May 1977) 458–473.

  3. Preparata, F. P., and Vuillemin, J., The cube-connected-cycles: A versatile network for parallel computation.CACM, 24, 5 (May 1981) 300–309.

    Google Scholar 

  4. Kleitman, D., Leighton, F. T., Lepley, M., and Miller, G. L., New layouts for the shuffle-exchange graph.Proc. 13th ACM Symp. on Th. of Computing, Milwaukee, Wisc., (May 1981); pp. 278–292.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801.

This work was supported in part by an IBM Predoctoral Fellowship and in part by the National Science Foundation under Grant MCS-81-05552.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bilardi, G., Jin, X. Permutation-exchange graphs that emulate the binary cube. Math. Systems Theory 17, 193–198 (1984). https://doi.org/10.1007/BF01744440

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01744440

Keywords