Partitioning a graph into defensive \(k\)-alliances (Q546272)

From MaRDI portal
Revision as of 05:51, 4 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
Partitioning a graph into defensive \(k\)-alliances
scientific article

    Statements

    title
    Partitioning a graph into defensive \(k\)-alliances (English)
    0 references
    publication date
    24 June 2011
    0 references
    zbMATH DE Number
    5912870
    0 references
    zbMATH Keywords
    defensive alliances
    0 references
    dominating sets
    0 references
    domination
    0 references
    isoperimetric number
    0 references
    OpenAlex ID
    W2103213531
    0 references
    arXiv ID
    0901.4923
    0 references
    Wikidata QID
    Q57974377
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q546272&oldid=35234469"
    Powered by MediaWiki