Constructing two completely independent spanning trees in hypercube-variant networks (Q338381)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Constructing two completely independent spanning trees in hypercube-variant networks
scientific article

    Statements

    Constructing two completely independent spanning trees in hypercube-variant networks (English)
    0 references
    0 references
    0 references
    4 November 2016
    0 references
    completely independent spanning trees
    0 references
    hypercube-variant networks
    0 references
    CIST-partition
    0 references
    diameter
    0 references

    Identifiers

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