English

An Improvement on Vizing's Conjecture

Combinatorics 2009-09-22 v1

Abstract

Let γ(G)\gamma(G) denote the domination number of a graph GG. A {\it Roman domination function} of a graph GG is a function f:V{0,1,2}f: V\to\{0,1,2\} such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number} γR(G)\gamma_R(G) is the minimum of f(V(G))=ΣvVf(v)f(V(G))=\Sigma_{v\in V}f(v) over all such functions. Let GHG\square H denote the Cartesian product of graphs GG and HH. We prove that γ(G)γ(H)γR(GH)\gamma(G)\gamma(H) \leq \gamma_R(G\square H) for all simple graphs GG and HH, which is an improvement of γ(G)γ(H)2γ(GH)\gamma(G)\gamma(H) \leq 2\gamma(G\square H) given by Clark and Suen \cite{CS}, since γ(GH)γR(GH)2γ(GH)\gamma(G\square H)\leq \gamma_R(G\square H)\leq 2\gamma(G\square H).

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

R2 v1 2026-06-21T13:48:31.388Z