Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
The electronic journal of combinatorics, Tome 12 (2005)
In this note we prove the following conjecture of Nowakowski and Rall: 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)\ge \Gamma(G)\Gamma(H).$
@article{10_37236_1979,
author = {Bo\v{s}tjan Bre\v{s}ar},
title = {Vizing-like conjecture for the upper domination of {Cartesian} products of graphs -- the proof},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1979},
zbl = {1074.05065},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1979/}
}
Boštjan Brešar. Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1979
Cité par Sources :