No label defined (Q3680873)
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 3902703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3902703 |
Statements
1984
0 references
domination number
0 references
graph product
0 references
0.8707777857780457
0 references
0.8670754432678223
0 references
0.8656437397003174
0 references
In this paper we consider a problem of Cockayne, to determine a relationship between the domination number of a graph product versus the product of the domination numbers. For some very special cases we show, in fact, that \[ (1)\quad \sigma (G\times H)\geq \sigma (G)\cdot \sigma (H), \] where \(\sigma\) (F) is the domination number of the graph F. This paper supports the conjecture that statement (1) is true for all graphs G and H.
0 references