An Improvement on Vizing's Conjecture
arXiv:0909.3695
Abstract
Let denote the domination number of a graph . A {\it Roman domination function} of a graph is a function such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number} is the minimum of over all such functions. Let denote the Cartesian product of graphs and . We prove that for all simple graphs and , which is an improvement of given by Clark and Suen \cite{CS}, since .
4 pages