On tight bounds for the \(k\)-forcing number of a graph (Q2421385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7066672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On tight bounds for the \(k\)-forcing number of a graph |
scientific article; zbMATH DE number 7066672 |
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
0 references
0.9671827
0 references
0.9593275
0 references
0.9375682
0 references
0.9375307
0 references
0.93357503
0 references
0.9285991
0 references
0.92742336
0 references
0 references
0.9173205
0 references
0 references
