THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS <font>UG<sub>B</sub></font>(n, n(n+1)) (Q2703012): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Hamiltonian property of generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized de Bruijn digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design to Minimize Diameter on Building-Block Network / rank
 
Normal rank

Revision as of 15:23, 3 June 2024

scientific article
Language Label Description Also known as
English
THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS <font>UG<sub>B</sub></font>(n, n(n+1))
scientific article

    Statements

    THE DIAMETER AND HAMILTONIAN CYCLE OF THE GENERALIZED DE BRUIJN GRAPHS <font>UG<sub>B</sub></font>(n, n(n+1)) (English)
    0 references
    0 references
    0 references
    2 July 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    diameter
    0 references
    de Bruijn graph
    0 references
    algorithm
    0 references
    Hamiltonian cycle
    0 references