On secure domination in graphs (Q2348710)
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 6445938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On secure domination in graphs |
scientific article; zbMATH DE number 6445938 |
Statements
On secure domination in graphs (English)
0 references
15 June 2015
0 references
combinatorial problems
0 references
computational complexity
0 references
secure domination
0 references
independence
0 references
domination
0 references
0.8939884305000305
0 references
0.8911256790161133
0 references
0.8909232020378113
0 references
0.886364758014679
0 references
0.8799477219581604
0 references
