The complexity of secure domination problem in graphs (Q1708386)

From MaRDI portal
Revision as of 21:11, 25 July 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
The complexity of secure domination problem in graphs
scientific article

    Statements

    The complexity of secure domination problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2018
    0 references
    secure domination
    0 references
    star convex bipartite graph
    0 references
    doubly chordal graph
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references

    Identifiers