One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:20, 30 January 2024
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
12 September 2011
0 references
hypercube
0 references
\(k\)-ary \(n\)-cube
0 references
Hamiltonian
0 references
disjoint path cover
0 references
interconnection networks
0 references
