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

From MaRDI portal
Revision as of 10:26, 9 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
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
    zero forcing set
    0 references
    zero forcing number
    0 references
    \(k\)-forcing
    0 references
    \(k\)-forcing number
    0 references
    connected dominating sets
    0 references
    connected domination number
    0 references
    \(k\)-independence number
    0 references
    rank
    0 references
    nullity
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references