Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824)
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: Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs |
scientific article; zbMATH DE number 6845573
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs |
scientific article; zbMATH DE number 6845573 |
Statements
Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (English)
0 references
1 March 2018
0 references
neighborhood total domination
0 references
algorithm complexity
0 references
labeled graph
0 references
0 references
