On the complexity of strong and weak total domination in graphs (Q2820195)
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: On the complexity of strong and weak total domination in graphs |
scientific article; zbMATH DE number 6627381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of strong and weak total domination in graphs |
scientific article; zbMATH DE number 6627381 |
Statements
14 September 2016
0 references
total dominating set
0 references
split graphs
0 references
On the complexity of strong and weak total domination in graphs (English)
0 references
0.8802922368049622
0 references
0.8553960919380188
0 references
0.8538393378257751
0 references
0.8514755964279175
0 references
0.8506751656532288
0 references
