Complexity of signed total \(k\)-Roman domination problem in graphs (Q2131507)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity of signed total \(k\)-Roman domination problem in graphs
scientific article

    Statements

    Complexity of signed total \(k\)-Roman domination problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2022
    0 references
    signed total Roman \(k\)-dominating function
    0 references
    signed total Roman \(k\)-domination number
    0 references
    complexity
    0 references

    Identifiers