An improved bound in Vizing's conjecture
classification
🧮 math.CO
keywords
gammafracsquareconjectureresultsuenvizingbound
read the original abstract
A well-known conjecture of Vizing is that $\gamma(G \square H) \ge \gamma(G)\gamma(H)$ for any pair of graphs $G, H$, where $\gamma$ is the domination number and $G \square H$ is the Cartesian product of $G$ and $H$. Suen and Tarr, improving a result of Clark and Suen, showed $\gamma(G \square H) \ge \frac{1}{2}\gamma(G)\gamma(H) + \frac{1}{2}\min(\gamma(G),\gamma(H))$. We further improve their result by showing $\gamma(G \square H) \ge \frac{1}{2}\gamma(G)\gamma(H) + \frac{1}{2}\max(\gamma(G),\gamma(H)).$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.