The complexity of secure domination problem in graphs (Q1708386)

From MaRDI portal
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
    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
    0 references
    0 references
    0 references

    Identifiers