Upper bounds on the \(k\)-forcing number of a graph (Q479006): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the \(k\)-forcing number of a graph |
scientific article |
Statements
Upper bounds on the \(k\)-forcing number of a graph (English)
0 references
5 December 2014
0 references
zero forcing set
0 references
zero forcing number
0 references
\(k\)-forcing
0 references
\(k\)-forcing number
0 references
connected dominating sets
0 references
connected domination number
0 references
\(k\)-independence number
0 references
rank
0 references
nullity
0 references
