On tight bounds for the \(k\)-forcing number of a graph (Q2421385): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On tight bounds for the \(k\)-forcing number of a graph |
scientific article |
Statements
On tight bounds for the \(k\)-forcing number of a graph (English)
0 references
17 June 2019
0 references
\(k\)-forcing
0 references
\(k\)-forcing number
0 references
zero forcing set
0 references
