论文信息 - On the domination number of 2-dimensional torus graphs

On the domination number of 2-dimensional torus graphs

The domination number of them×n torus graph is denoted by γ(Cm Cn). Here, an algorithm based on dynamic programming is presented which can be used to determine γ(Cm Cn) as a function of n when m is fixed. The value of γ(Cm Cn) has previously been determined for m ≤ 10 and arbitrary n. These results are here extended to m ≤ 20 and arbitrary n.

Patric R. J. Östergård | Simon Crevals

[1] Christina M. Mynhardt,et al. Domination of generalized Cartesian products , 2010, Discret. Math..

[2] Patric R. J. Östergård,et al. Computing the Domination Number of Grid Graphs , 2011, Electron. J. Comb..

[3] Ramy S. Shaheen. Bounds for the 2-domination number of toroidal grid graphs , 2009, Int. J. Comput. Math..

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

[5] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[6] Stéphan Thomassé,et al. The Domination Number of Grids , 2011, SIAM J. Discret. Math..

[7] Douglas M. Van Wieren. Critical cyclic patterns related to the domination number of the torus , 2007, Discret. Math..

[8] P. Horak. On perfect Lee codes , 2009, Discret. Math..

[9] Mohamed H. El-Zahar,et al. On the Domination Number of the Product of Two Cycles , 2007, Ars Comb..

[10] Constant Time Computation of Minimum Dominating Sets , 1994 .

[11] Thi Vo. On the domination number of grid graphs , 1988 .

[12] C. Y. Lee,et al. Some properties of nonbinary error-correcting codes , 1958, IRE Trans. Inf. Theory.