A bound on the k-domination number of a graph (Q3073450): 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 22:47, 3 February 2024

scientific article
Language Label Description Also known as
English
A bound on the k-domination number of a graph
scientific article

    Statements

    A bound on the k-domination number of a graph (English)
    0 references
    0 references
    11 February 2011
    0 references
    domination
    0 references
    \(k\)-domination number
    0 references
    \(P_4\)-free graph
    0 references

    Identifiers