A note on the complexity of locating-total domination in graphs (Q2333807)
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 7129483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of locating-total domination in graphs |
scientific article; zbMATH DE number 7129483 |
Statements
A note on the complexity of locating-total domination in graphs (English)
0 references
13 November 2019
0 references
locating-total dominating set
0 references
complexity
0 references
0.9783582
0 references
0.9583964
0 references
0 references
0 references
0.9473996
0 references
0.9233576
0 references
0.92323196
0 references
0.9226739
0 references
0 references
