Upper bounds on the \(k\)-forcing number of a graph (Q479006)
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 6377035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the \(k\)-forcing number of a graph |
scientific article; zbMATH DE number 6377035 |
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
0 references
0 references
0 references
0.8819907903671265
0 references
0.8688315153121948
0 references
0.8221889734268188
0 references
0.8152939081192017
0 references
0.8149298429489136
0 references
