Connected power domination in graphs (Q2424811)

From MaRDI portal
Revision as of 16:12, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Connected power domination in graphs
scientific article

    Statements

    title
    Connected power domination in graphs (English)
    0 references
    author
    Boris Brimkov
    0 references
    Derek Mikesell
    0 references
    Logan Smith
    0 references
    publication date
    25 June 2019
    0 references
    zbMATH Keywords
    connected power domination
    0 references
    power domination
    0 references
    cactus graph
    0 references
    NP-completeness
    0 references
    integer program
    0 references
    zero forcing
    0 references
    cites work
    Q5374237
    0 references
    Q3097395
    0 references
    Q4198056
    0 references
    Q3895508
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C69
    0 references
    05C57
    0 references
    94C15
    0 references
    05C82
    0 references
    zbMATH DE Number
    7073184
    0 references
    OpenAlex ID
    W2963641569
    0 references
    arXiv ID
    1712.02388
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2424811&oldid=36503660"
    Powered by MediaWiki