An upper bound for the total restrained domination number of graphs (Q367057)

From MaRDI portal
Revision as of 22:44, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound for the total restrained domination number of graphs
scientific article

    Statements

    An upper bound for the total restrained domination number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2013
    0 references
    0 references
    total restrained domination number
    0 references
    total restrained dominating set
    0 references
    independent set
    0 references
    matching
    0 references
    probabilistic method
    0 references
    open packing
    0 references
    0 references