Total \(\{k\}\)-domination in special graphs (Q2668541)
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 7485125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total \(\{k\}\)-domination in special graphs |
scientific article; zbMATH DE number 7485125 |
Statements
Total \(\{k\}\)-domination in special graphs (English)
0 references
7 March 2022
0 references
domination theory
0 references
algorithms
0 references
total \(k\)-domination number
0 references
NP-hardness
0 references
0.8967798352241516
0 references
0.8964394330978394
0 references
0.8945340514183044
0 references
0.8851667046546936
0 references
0.8605767488479614
0 references
