论文信息 - On Vizing's conjecture

On Vizing's conjecture

A dominating set D for a graph G is a subset of V (G) such that any vertex in V (G)−D has a neighbor in D, and a domination number γ(G) is the size of a minimum dominating set for G. For the Cartesian product G2H Vizing’s conjecture [10] states that γ(G2H) ≥ γ(G)γ(H) for every pair of graphs G, H. In this paper we introduce a new concept which extends the ordinary domination of graphs, and prove that the conjecture holds when γ(G) = γ(H) = 3.

Bostjan Bresar

[1] David C. Fisher. Domination, Fractional Domination, 2-Packing, and Graph Products , 1994, SIAM J. Discret. Math..

[2] Norbert Seifter,et al. Dominating Cartesian Products of Cycles , 1995, Discret. Appl. Math..

[3] W. Edwin Clark,et al. The domination numbers of the 5 × n and 6 × n grid graphs , 1993, J. Graph Theory.

[4] Douglas F. Rall,et al. Vizing's conjecture and the one-half argument , 1995, Discuss. Math. Graph Theory.

[5] V. G. Vizing. SOME UNSOLVED PROBLEMS IN GRAPH THEORY , 1968 .

[6] V. G. Vizing. The cartesian product of graphs , 1963 .

[7] Kang Liying,et al. Some results on domination number of products of graphs , 1998 .

[8] Michael S. Jacobson,et al. On the domination of the products of graphs II: Trees , 1986, J. Graph Theory.