Complexity issues of variants of secure domination in graphs (Q2413340): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:34, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity issues of variants of secure domination in graphs |
scientific article |
Statements
Complexity issues of variants of secure domination in graphs (English)
0 references
10 April 2018
0 references
secure dominating set
0 references
split graph
0 references
NP-completeness
0 references
total domination
0 references
