The Hamiltonian property of generalized de Bruijn digraphs (Q1179462): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q656146
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: John W. Moon / rank
 
Normal rank

Revision as of 08:31, 20 February 2024

scientific article
Language Label Description Also known as
English
The Hamiltonian property of generalized de Bruijn digraphs
scientific article

    Statements

    The Hamiltonian property of generalized de Bruijn digraphs (English)
    0 references
    0 references
    26 June 1992
    0 references
    Let \(G_ B(n,d)\) denote the digraph with \(n\) nodes \(0,1,\dots,n-1\) and \(nd\) arcs of the form \(\overrightarrow{ij}\) where \(j=di+r\) (mod \(n\)), \(0\leq i\leq n-1\), \(0\leq r\leq d-1\). The digraph \(G_ I(n,d)\) is defined similarly except that now \(j=d(n-1-i)+r\). The authors' main result is that if \(d\geq 3\) and \(gcd(n,d)=1\), then both \(G_ B(n,d)\) and \(G_ I(n,d)\) have Hamilton circuits. The results in this paper plus results known earlier settle the problem of determining which of these graphs wave Hamilton circuits.
    0 references
    de Bruijn digraphs
    0 references
    Hamilton circuits
    0 references
    0 references

    Identifiers