Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (Q2571305)
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: Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof |
scientific article; zbMATH DE number 2221802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof |
scientific article; zbMATH DE number 2221802 |
Statements
Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (English)
0 references
1 November 2005
0 references
Summary: We prove the following conjecture of \textit{R. J. Nowakowski} and \textit{D. F. Rall} [Discuss. Math., Graph Theory 16, 53--79 (1996; Zbl 0865.05071)]: For arbitrary graphs \(G\) and \(H\) the upper domination number of the Cartesian product \(G\square H\) is at least the product of their upper domination numbers, in symbols: \(\Gamma(G\square H)\geq \Gamma(G)\Gamma(H)\).
0 references
0.8751635551452637
0 references
0.8632920980453491
0 references
0.8618067502975464
0 references
0.8593856692314148
0 references
0.85938560962677
0 references
