Complexity issues of variants of secure domination in graphs (Q2413340)

From MaRDI portal
Revision as of 07:30, 4 August 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
Complexity issues of variants of secure domination in graphs
scientific article

    Statements

    Complexity issues of variants of secure domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    secure dominating set
    0 references
    split graph
    0 references
    NP-completeness
    0 references
    total domination
    0 references