On domination numbers of Cartesian product of paths

被引：30

作者：

Gravier, S

Mollard, M

机构：

[1] CNRS, LSD2, IMAG, Lab Leibniz, F-38041 Grenoble 9, France

[2] Univ Grenoble 1, LSD2, IMAG, Lab Leibniz, F-38041 Grenoble, France

来源：

DISCRETE APPLIED MATHEMATICS | 1997年 / 80卷 / 2-3期

关键词：

D O I：

10.1016/S0166-218X(97)00091-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show the link between the existence of perfect Lee codes and minimum dominating sets of Cartesian products of paths and cycles. From the existence of such a code we deduce the asymptotical values of the domination numbers of these graphs.

引用

页码：247 / 250

页数：4

共 5 条

[1]

BERLEKAMP ER, 1968, ALGEBRAIC CODING THE

[2] THE DOMINATION NUMBERS OF THE 5XN AND 6XN GRID GRAPHS [J].

CHANG, TY ;

CLARK, WE .

JOURNAL OF GRAPH THEORY, 1993, 17 (01) :81-107

[3] PERFECT CODES IN LEE METRIC AND PACKING OF POLYOMINOES [J].

GOLOMB, SW ;

WELCH, LR .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (02) :302-+

[4]

Jacobson M. S., 1984, I. Ars Combin., V18, P33

[5] DOMINATING CARTESIAN PRODUCTS OF CYCLES [J].

KLAVZAR, S ;

SEIFTER, N .

DISCRETE APPLIED MATHEMATICS, 1995, 59 (02) :129-136

← 1 →