A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:16, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube |
scientific article |
Statements
A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (English)
0 references
20 June 2014
0 references
interconnection network
0 references
linear-time algorithm
0 references
reflected sequence
0 references
Hamiltonian
0 references
crossed cubes
0 references
prescribed edge
0 references