Client-server and cost effective sets in graphs (Q1713579)

From MaRDI portal
Revision as of 05:35, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Client-server and cost effective sets in graphs
scientific article

    Statements

    title
    Client-server and cost effective sets in graphs (English)
    0 references
    author
    Mustapha Chellali
    0 references
    Teresa W. Haynes
    0 references
    Stephen T. Hedetniemi
    0 references
    publication date
    25 January 2019
    0 references
    zbMATH Keywords
    cost effective sets
    0 references
    \(k\)-cost-effective sets
    0 references
    domination
    0 references
    \(k\)-cost effective domination
    0 references
    global \(k\)-offensive alliances
    0 references

    Identifiers

    zbMATH DE Number
    7006948
    0 references
    OpenAlex ID
    W2774370208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1713579&oldid=38712227"
    Powered by MediaWiki