A result on Vizing's conjecture
暂无分享,去创建一个
Let γ(G) denote the domination number of a simple graph G and let G?H denote the Cartesian product of two simple graphs G and H. In this paper we prove that if γ(G)=3, then γ(G?H)?γ(G)γ(H).
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Bostjan Bresar. On Vizing's conjecture , 2001, Discuss. Math. Graph Theory.
[3] V. G. Vizing. The cartesian product of graphs , 1963 .
[4] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .