arXiv:0909.3695 [math.CO]AbstractReferencesReviewsResources
An Improvement on Vizing's Conjecture
Published 2009-09-21Version 1
Let $\gamma(G)$ denote the domination number of a graph $G$. A {\it Roman domination function} of a graph $G$ is a function $f: V\to\{0,1,2\}$ such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number} $\gamma_R(G)$ is the minimum of $f(V(G))=\Sigma_{v\in V}f(v)$ over all such functions. Let $G\square H$ denote the Cartesian product of graphs $G$ and $H$. We prove that $\gamma(G)\gamma(H) \leq \gamma_R(G\square H)$ for all simple graphs $G$ and $H$, which is an improvement of $\gamma(G)\gamma(H) \leq 2\gamma(G\square H)$ given by Clark and Suen \cite{CS}, since $\gamma(G\square H)\leq \gamma_R(G\square H)\leq 2\gamma(G\square H)$.
Comments: 4 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1103.2419 [math.CO] (Published 2011-03-12)
Roman domination number of Generalized Petersen Graphs P(n,2)
arXiv:1706.03682 [math.CO] (Published 2017-06-12)
Two inequalities related to Vizing's conjecture
Sum-of-Squares Certificates for Vizing's Conjecture via Determining Gröbner Bases