Secure total domination in graphs: bounds and complexity (Q1786876): Difference between revisions
From MaRDI portal
Latest revision as of 15:45, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Secure total domination in graphs: bounds and complexity |
scientific article |
Statements
Secure total domination in graphs: bounds and complexity (English)
0 references
25 September 2018
0 references
secure total dominating set
0 references
secure total domination number
0 references
computational complexity
0 references
approximation algorithms
0 references
0 references