A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:45, 30 January 2024
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
14 May 2012
0 references
zero forcing number
0 references
zero spread
0 references
maximum nullity
0 references
cut-vertex reduction
0 references
unicyclic graphs
0 references
