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 this page instead for the normal view: On secure domination in graphs |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On secure domination in graphs |
scientific article |
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