Leafy spanning trees in hypercubes (Q5950587): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:46, 4 March 2024

scientific article; zbMATH DE number 1684749
Language Label Description Also known as
English
Leafy spanning trees in hypercubes
scientific article; zbMATH DE number 1684749

    Statements

    Leafy spanning trees in hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 January 2002
    0 references
    A lower bound is found for the number of leaves of a spanning tree in a \(d\)-dimensional hypercube. This improves on the bound implied by a more general result of \textit{D. J. Kleitman} and \textit{D. B. West} [SIAM J. Discrete Math. 4, No. 1, 99-106 (1991; Zbl 0734.05041)].
    0 references
    leaves in trees of hypercubes
    0 references

    Identifiers