Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (Q2571305)

From MaRDI portal
Revision as of 07:38, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
scientific article

    Statements

    Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (English)
    0 references
    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

    Identifiers