Complexity issues of variants of secure domination in graphs (Q2413340)

From MaRDI portal
Revision as of 08:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity issues of variants of secure domination in graphs
scientific article

    Statements

    title
    Complexity issues of variants of secure domination in graphs (English)
    0 references
    author
    Devendra Lad
    0 references
    P. Venkata Subba Reddy
    0 references
    J. Pavan Kumar
    0 references
    publication date
    10 April 2018
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C40
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6857622
    0 references
    zbMATH Keywords
    secure dominating set
    0 references
    split graph
    0 references
    NP-completeness
    0 references
    total domination
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2413340&oldid=26944185"
    Powered by MediaWiki