Complexity issues of perfect secure domination in graphs (Q5037201)
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: Complexity issues of perfect secure domination in graphs |
scientific article; zbMATH DE number 7481653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity issues of perfect secure domination in graphs |
scientific article; zbMATH DE number 7481653 |
Statements
Complexity issues of perfect secure domination in graphs (English)
0 references
28 February 2022
0 references
secure domination
0 references
perfect secure domination
0 references
NP-complete
0 references
0.9726571
0 references
0.9701939
0 references
0 references
0.9508897
0 references
0 references
0.9484861
0 references
0.94470084
0 references
0 references
0.9384326
0 references
0.9331877
0 references
