Graphs and Combinatorics

, Volume 7, Issue 1, pp 65–87 | Cite as

Symmetric edge-decompositions of hypercubes

  • Mark Ramras


We call a set of edgesE of the n-cubeQ n a fundamental set for Q n if for some subgroupG of the automorphism group ofQ n , theG-translates ofE partition the edge set ofQ n .Q n possesses an abundance of fundamental sets. For example, a corollary of one of our main results is that if |E| =n and the subgraph induced byE is connected, then if no three edges ofE are mutually parallel,E is a fundamental set forQ n . The subgroupG is constructed explicitly. A connected graph onn edges can be embedded intoQ n so that the image of its edges forms such a fundamental set if and only if each of its edges belongs to at most one cycle.

We also establish a necessary condition forE to be a fundamental set. This involves a number-theoretic condition on the integersa j (E), where for 1 ≤jn, a j (E) is the number of edges ofE in thej th direction (i.e. parallel to thej th coordinate axis).


Automorphism Group Coordinate Axis Connected Graph Edge Form Condition forE 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aubert, J., Schneider, B.: Decomposition de la somme cartesienne d'un cycle et de l'union de deux cycles Hamiltoniens en cycles Hamiltoniens. Discrete Math.38, 7–16 (1982)Google Scholar
  2. 2.
    Bollobás, B., Eldridge, S.E.: Packing of graphs and applications to computational complexity. J. Comb. Theory, Ser B25, 105–124 (1978)Google Scholar
  3. 3.
    Burns, D., Schuster, S.: Every (p, p − 1) graph is contained in its complement. J. Graph Theory1, 277–279 (1977)Google Scholar
  4. 4.
    Burns, D., Schuster, S.: Embedding (p,p − 1) graphs in their complements. Isr. J. Math.30, 313–320 (1978)Google Scholar
  5. 5.
    de Caen, D.: oral communicationGoogle Scholar
  6. 6.
    Fink, J.F.: On the decomposition ofn-cubes into isomorphic trees. J. Graph Theory. (to appear)Google Scholar
  7. 7.
    Gilbert, E.N.: Gray codes and paths on then-cube. Bell System Tech. J.37, 815–826 (1958)Google Scholar
  8. 8.
    Golomb, S.W.: Tiling with polyominoes. J. Comb. Theory1, 289–296 (1966)Google Scholar
  9. 9.
    Grünbaum, B., Shephard, G.C.: Tilings and Patterns. W.H. Freeman and Co., New York 1987Google Scholar
  10. 10.
    Harary, F., Robinson, R.W.: Isomorphic factorizations X: Unsolved problems. J. Graph Theory9, 67–86 (1985)Google Scholar
  11. 11.
    Kotzig, A.: Decompositions of complete graphs into isomorphic cubes. J. Comb. Theory, Ser. B31, 292–296 (1981)Google Scholar
  12. 12.
    Kotzig, A.: Every cartesian product of two circuits is decomposable into two Hamiltonian circuits. Montreal: Centre de Recherche Mathematique 1973Google Scholar
  13. 13.
    Ringel, G.: Über drei kombinatorische Probleme am n-dimensionalen Wurfel und Wurfelgitter. Abh. Math. Semin. Univ. Hamb.20, 10–19 (1955)Google Scholar
  14. 14.
    Sauer, N., Spencer, J.: Edge-disjoint placement of graphs. J. Comb. Theory, Ser B25, 295–302 (1978)Google Scholar
  15. 15.
    Slater, P.J., Teo, S.K., Yap, H.P.: Packing a tree with a graph of the same size. J. Graph Theory9, 213–216 (1985)Google Scholar
  16. 16.
    Wiedemann, D.: Hamming Geometry. Ph.D Thesis, University of Waterloo, 1986Google Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Mark Ramras
    • 1
  1. 1.Department of MathematicsNortheastern UniversityBostonUSA

Personalised recommendations