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 the normal view instead:
scientific article; zbMATH DE number 6845573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8919782638549805
0 references
0.8419192433357239
0 references
0.8384625315666199
0 references
0.8293886184692383
0 references
0.8275063037872314
0 references
