An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs (Q2166291)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs
scientific article

    Statements

    An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs (English)
    0 references
    0 references
    24 August 2022
    0 references
    keywords zero forcing
    0 references
    power domination
    0 references
    hypergraphs
    0 references

    Identifiers