Hamilton circuits in the directed wrapped Butterfly network (Q1392560)

From MaRDI portal
Revision as of 08:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hamilton circuits in the directed wrapped Butterfly network
scientific article

    Statements

    Hamilton circuits in the directed wrapped Butterfly network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 1998
    0 references
    The authors prove that the wrapped Butterfly digraph of outdegree \(d\) and dimension \(n\) contains at least \(d-1\) arc-disjoint Hamilton directed cycles. They conjecture there is a Hamilton decomposition in all cases other than \(d=n=2\); \(d=2\) and \(n=3\); and \(d=3\) and \(n=2\). They offer strong evidence in support of the conjecture. Helen Verrall recently has completed the proof of the conjecture (Discrete Appl. Math., to appear).
    0 references
    Hamilton decomposition
    0 references
    Hamilton directed cycle
    0 references
    wrapped Butterfly digraph
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references