On tight bounds for the \(k\)-forcing number of a graph (Q2421385): 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.1007/s40840-017-0507-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2617188003 / rank | |||
Normal rank | |||
Revision as of 01:46, 20 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
