Upper bounds on the \(k\)-forcing number of a graph (Q479006)

From MaRDI portal
Revision as of 09:56, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Upper bounds on the \(k\)-forcing number of a graph
scientific article

    Statements

    Upper bounds on the \(k\)-forcing number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references