Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489)
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 7690961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of total Roman ${2}$-domination in graphs |
scientific article; zbMATH DE number 7690961 |
Statements
1 June 2023
0 references
Roman \(\{2\}\)-dominating function
0 references
total Roman \(\{2\}\)-domination
0 references
APX-completeness
0 references
Algorithmic aspects of total Roman ${2}$-domination in graphs (English)
0 references
0 references
0.9682028
0 references
0.96307147
0 references
0.95602196
0 references
0.95159125
0 references
0.95067644
0 references
0.9471001
0 references
0.94049335
0 references
0.93867266
0 references
0.93755156
0 references
0.93714404
0 references
