
doi: 10.37236/15
Vizing conjectured in 1963 that $\gamma(G \Box H) \geq \gamma(G)\gamma(H)$ for any graphs $G$ and $H$. A graph $G$ is said to satisfy Vizing's conjecture if the conjectured inequality holds for $G$ and any graph $H$. Vizing's conjecture has been proved for $\gamma(G) \le 3$, and it is known to hold for other classes of graphs. Clark and Suen in 2000 showed that $\gamma(G \Box H) \geq \frac{1}{2}\gamma(G)\gamma(H)$ for any graphs $G$ and $H$. We give a slight improvement of this inequality by tightening their arguments.
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph operations (line graphs, products, etc.), cartesian product
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph operations (line graphs, products, etc.), cartesian product
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
