Perfect Roman domination in graphs (Q2333784)

From MaRDI portal
Revision as of 01:24, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Perfect Roman domination in graphs
scientific article

    Statements

    title
    Perfect Roman domination in graphs (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    13 November 2019
    0 references
    zbMATH Keywords
    domination
    0 references
    Roman domination
    0 references
    perfect Roman domination
    0 references
    polynomial time algorithm
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C85
    0 references
    68Q17
    0 references
    68W40
    0 references
    zbMATH DE Number
    7129460
    0 references
    OpenAlex ID
    W2967821251
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2333784&oldid=39015820"
    Powered by MediaWiki