One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes (Q638511): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013976694 / rank | |||
Normal rank | |||
Revision as of 20:47, 19 March 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
