Liar's domination in graphs: complexity and algorithm (Q1949115)

From MaRDI portal
Revision as of 06:19, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Liar's domination in graphs: complexity and algorithm
scientific article

    Statements

    title
    Liar's domination in graphs: complexity and algorithm (English)
    0 references
    author
    B. S. Panda
    0 references
    Subhabrata Paul
    0 references
    publication date
    25 April 2013
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6157670
    0 references
    zbMATH Keywords
    graph algorithm
    0 references
    NP-completeness
    0 references
    domination
    0 references
    Liar's domination
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1949115&oldid=26611613"
    Powered by MediaWiki