One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511)

From MaRDI portal
Revision as of 01:50, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
scientific article

    Statements

    One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (English)
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    hypercube
    0 references
    \(k\)-ary \(n\)-cube
    0 references
    Hamiltonian
    0 references
    disjoint path cover
    0 references
    interconnection networks
    0 references