Unfolding cubes: nets, packings, partitions, chords (Q2215462)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Unfolding cubes: nets, packings, partitions, chords
scientific article

    Statements

    Unfolding cubes: nets, packings, partitions, chords (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2020
    0 references
    An \(n\)-cube is an \(n\)-dimensional convex polytope. Every \(n\)-cube is build from \(2n\) subcubes of dimension \(n-1\) and every \((n-1)\)-subcube has a unique dual \((n-1)\)-subcube such that they have empty intersection. The \(n\)-Roberts graph (also known as \(n\)-coctail party graph) is the intersection graph of \((n-1)\)-subcubes of an \(n\)-cube. In this work authors present different methods how to unfold an \(n\)-cube into nets of all its \((n-1)\)-subcubes. The main method is to take a spanning tree of a \(n\)-Roberts graph and with some operations one get the net of its \((n-1)\)-subcubes with respect to the starting spanning tree. Special case represents spanning paths and in particular spanning paths that start and end in nonadjacent vertices of the \(n\)-Roberts graph.
    0 references
    0 references
    \(n\)-cube
    0 references
    unfolding cube
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references