On the complexity of signed and minus total domination in graphs (Q990954)
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 the complexity of signed and minus total domination in graphs |
scientific article; zbMATH DE number 5777511
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of signed and minus total domination in graphs |
scientific article; zbMATH DE number 5777511 |
Statements
On the complexity of signed and minus total domination in graphs (English)
0 references
1 September 2010
0 references
graph algorithms
0 references
minus total dominating functions
0 references
signed total dominating functions
0 references
chordal bipartite graphs
0 references
doubly chordal graphs
0 references
0.9093483686447144
0 references
0.8958607316017151
0 references
0.873694896697998
0 references
0.8647845387458801
0 references
