Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892)
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: Graphs that are simultaneously efficient open domination and efficient closed domination graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs that are simultaneously efficient open domination and efficient closed domination graphs |
scientific article |
Statements
Graphs that are simultaneously efficient open domination and efficient closed domination graphs (English)
0 references
15 March 2017
0 references
efficient open domination
0 references
efficient closed domination
0 references
perfect code
0 references
computational complexity
0 references
Sierpiński graph
0 references
0 references
0 references
0.8029527068138123
0 references
0.7670649290084839
0 references
0.7631496787071228
0 references
