Complexity issues of variants of secure domination in graphs (Q2413340)
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 6857622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity issues of variants of secure domination in graphs |
scientific article; zbMATH DE number 6857622 |
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
0.9466117024421692
0 references
0.8859789967536926
0 references
0.880277693271637
0 references
0.8771382570266724
0 references
0.8733702301979065
0 references
