A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.05.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974753353 / rank | |||
Normal rank | |||
Revision as of 03:08, 20 March 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
