The relationship between \(k\)-forcing and \(k\)-power domination (Q1744766)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The relationship between k-forcing and k-power domination |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The relationship between \(k\)-forcing and \(k\)-power domination |
scientific article |
Statements
The relationship between \(k\)-forcing and \(k\)-power domination (English)
0 references
19 April 2018
0 references
\(k\)-power domination
0 references
\(k\)-forcing
0 references
subgraph contraction
0 references
Sierpiński graphs
0 references
0.7768415212631226
0 references
0.7747383117675781
0 references
0.7563444972038269
0 references
0.7560520768165588
0 references
0.7539702653884888
0 references
