A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On some super fault-tolerant Hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A recursively construction scheme for super fault-tolerant Hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Topological properties of the crossed cube architecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Node-pancyclicity and edge-pancyclicity of crossed cubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-tolerant Hamiltonian connectedness of cycle composition networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4002466 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault-tolerant cycle-embedding of crossed cubes / rank | |||
Normal rank | |||
Revision as of 15:09, 8 July 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
