On the crossing number of the hypercube and the cube connected cycles

  • Ondrej Sýkora
  • Imrich Vrťo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 570)


We prove tight bounds for the crossing number of the n-dimensional hypercube and cube connected cycles (CCC) graphs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Brebner, G., Relating routing graphs and two dimensional array grids, In:Proceedings VLSI: Algorithms and Architectures, North Holland, 1985.Google Scholar
  2. [2]
    Eggleton, R. B., Guy, R. P., The crossing number of the n-cube, Notices of the American Mathematical Society, 17, 1970, 757.Google Scholar
  3. [3]
    Erdös, P., Guy, R.P., Crossing number problems, AmericanMathematical Monthly, 80, 1, 1973, 52–58.Google Scholar
  4. [4]
    Harary, F., Hayes, J. P., Horng-Jyh Wu, A survey of the theory of hypercube graphs, Computers and Mathematics with Applications, 15, 4, 1988, 277–289.Google Scholar
  5. [5]
    Heath, M. I. (editor), Hypercube Multicomputers, Proceedings of the 2-nd Conference on Hypercube Multicomputers, SIAM, 1987.Google Scholar
  6. [6]
    Kleitman, D. J., The crossing number of K 5,n, Journal of Combinatorial Theory, 9, 1971, 315–323.Google Scholar
  7. [7]
    Leighton, F. T., New lower bound techniques for VLSI, In: Proceedings of the 22-nd Annual Symposium on Foundations of Computer Science, 1981, 1–12.Google Scholar
  8. [8]
    Leiserson, C. E., Area efficient graph layouts (for VLSI), In: Proceedings of the 21-st Annual IEEE Symposium on Foundations of Computer Science, 1980, 270–281.Google Scholar
  9. [9]
    Kainen, P. C., A lower bound for crossing numbers of graphs with applications to K n,K p,q, and Q(d), Journal of Combinatorial Theory (B), 12, 1972, 287–298.Google Scholar
  10. [10]
    Preparata, F. P., Vuillemin, J. E., The cube-connected cycles: a versatile network for parallel computation, In: Proceedings of the 20-th Annual IEEE Symposium on Foundations of Computer Science, 1979, 140–147.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ondrej Sýkora
    • 1
  • Imrich Vrťo
    • 1
  1. 1.Computing CentreSlovak Academy of SciencesBratislavaCzecho-Slovakia

Personalised recommendations