On the complexity of signed and minus total domination in graphs (Q990954)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of signed and minus total domination in graphs
scientific article

    Statements

    On the complexity of signed and minus total domination in graphs (English)
    0 references
    0 references
    1 September 2010
    0 references
    graph algorithms
    0 references
    minus total dominating functions
    0 references
    signed total dominating functions
    0 references
    chordal bipartite graphs
    0 references
    doubly chordal graphs
    0 references

    Identifiers