Partitioning the vertex set of \(G\) to make \(G\square H\) an efficient open domination graph (Q2965982)
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: Partitioning the vertex set of G to make G H an efficient open domination graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the vertex set of \(G\) to make \(G\square H\) an efficient open domination graph |
scientific article |
Statements
3 March 2017
0 references
efficient open domination
0 references
Cartesian product
0 references
vertex labeling
0 references
total domination
0 references
math.CO
0 references
0.907093584537506
0 references
0.7751786112785339
0 references
0.7717682719230652
0 references
