Inequality Related to Vizing's Conjecture
Abstract
Let $\gamma(G)$ denote the domination number of a graph $G$ and let $G\square H$ denote the Cartesian product of graphs $G$ and $H$. We prove that $\gamma(G)\gamma(H) \le 2 \gamma(G\square H)$ for all simple graphs $G$ and $H$.
Published
2000-05-24
How to Cite
Clark, W. E., & Suen, S. (2000). Inequality Related to Vizing’s Conjecture. The Electronic Journal of Combinatorics, 7(1), N4. https://doi.org/10.37236/1542
Issue
Article Number
N4