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

From MaRDI portal
Revision as of 17:55, 20 June 2023 by Importer (talk | contribs) (‎Created a new 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