A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube (Q2016337)

From MaRDI portal
Revision as of 15:09, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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

    Identifiers