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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 18:43, 1 February 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