A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535)

From MaRDI portal
Revision as of 01:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A technique for computing the zero forcing number of a graph with a cut-vertex
scientific article

    Statements

    A technique for computing the zero forcing number of a graph with a cut-vertex (English)
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    zero forcing number
    0 references
    zero spread
    0 references
    maximum nullity
    0 references
    cut-vertex reduction
    0 references
    unicyclic graphs
    0 references