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

From MaRDI portal
Revision as of 01:30, 27 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57974377, #quickstatements; #temporary_batch_1719448105926)
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 Keywords
    defensive alliances
    0 references
    dominating sets
    0 references
    domination
    0 references
    isoperimetric number
    0 references

    Identifiers

    zbMATH DE Number
    5912870
    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=35004595"
    Powered by MediaWiki