An Improvement on Vizing's Conjecture
Combinatorics
2009-09-22 v1
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 .
Keywords
Cite
@article{arxiv.0909.3695,
title = {An Improvement on Vizing's Conjecture},
author = {Yunjian Wu},
journal= {arXiv preprint arXiv:0909.3695},
year = {2009}
}
Comments
4 pages