A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A technique for computing the zero forcing number of a graph with a cut-vertex |
scientific article; zbMATH DE number 6034502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A technique for computing the zero forcing number of a graph with a cut-vertex |
scientific article; zbMATH DE number 6034502 |
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
0 references
0 references
0.8428535461425781
0 references
0.8249356150627136
0 references
0.8199921250343323
0 references
0.8196412324905396
0 references
0.8179187774658203
0 references
