On multiple coverings of the infinite rectangular grid with balls of constant radius

被引:19
作者
Axenovich, MA
机构
[1] Iowa State Univ Sci & Technol, Dept Math, Ames, IA 50011 USA
[2] Univ Illinois, Urbana, IL 61801 USA
关键词
perfect coverings; covering codes; isotropic (distributive) colorings; rectangular grid;
D O I
10.1016/S0012-365X(02)00744-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We consider the coverings of graphs with balls of constant radius satisfying special multiplicity condition. A (t,i,j)-cover of a graph G = (V,E) is a subset S of vertices, such that every element of S belongs to exactly i balls of radius t centered at elements of S and every element of V \ S belongs to exactly j balls of radius t centered at elements of S. For the infinite rectangular grid, we show that in any (t,i,j)-cover, i and j differ by at most t + 2 except for one degenerate case. Furthermore, for i and j satisfying \i - j\ > 4 we show that all (t,i,j)-covers are the unions of the diagonals periodically located in the grid. Also, we give the description of all (l,i,j)-covers. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:31 / 48
页数:18
相关论文
共 13 条
[1]  
[Anonymous], 1993, J COMBIN MATH COMBIN
[2]  
[Anonymous], FUNDAMENTALS DOMINAT
[3]  
Biggs N., 1973, Journal of Combinatorial Theory, Series B, V15, P289, DOI 10.1016/0095-8956(73)90042-7
[4]  
Fellows MR., 1991, AUSTRALAS J COMB, V3, P141
[5]  
Golomb S.W., 1994, BASIC CONCEPTS INFOR
[6]  
HAYNES TW, 1998, ADV TOPICS PURE APPL, V209
[7]  
Kratochvil J., 1987, C MATH SOC JANOL BOL, V52, P357
[8]  
KRATOCHVIL J, 1990, P RANDOM GRAPHICS 87, P141
[9]  
KRATOCHVIL J, 1991, ROZPRAVY CESKOSLOVEN, V101, P126
[10]  
ROMAN S, 1992, GRADUATE TEXTS MATH, V134, P486