The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:36, 5 March 2024

scientific article
Language Label Description Also known as
English
The domination number of the graph defined by two levels of the \(n\)-cube
scientific article

    Statements

    The domination number of the graph defined by two levels of the \(n\)-cube (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2021
    0 references
    domination number
    0 references
    Turán theorem
    0 references
    transversal design
    0 references

    Identifiers