Complexity and computation of connected zero forcing (Q2012050)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity and computation of connected zero forcing
scientific article

    Statements

    Complexity and computation of connected zero forcing (English)
    0 references
    0 references
    0 references
    27 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected zero forcing
    0 references
    zero forcing
    0 references
    NP-completeness
    0 references
    unicyclic graph
    0 references
    cactus graph
    0 references
    block graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references