On the ruegularity of perfect 2-colorings of the Johnson graph

被引：5

作者：

Mogil'nykh, I. Yu ^{[1
]}

机构：

[1] Novosibirsk State Univ, RAS, Siberian Branch, Sobolev Inst Math, Novosibirsk 630090, Russia

来源：

PROBLEMS OF INFORMATION TRANSMISSION | 2007年 / 43卷 / 04期

关键词：

D O I：

10.1134/S0032946007040035

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study perfect colorings of the Johnson graph in two colors. We give sufficient conditions for a perfect coloring of the Johnson graph to be k-regular and present examples of perfect colorings. The proof of the theorem is in many respects similar to the proof of the result by Etzion and Schwartz [1] on k-regularity of perfect codes.

引用

页码：303 / 309

页数：7

共 7 条

[1] On perfect codes and related concepts [J].

Ahlswede, R ;

Aydinian, HK ;

Khachatrian, LH .

DESIGNS CODES AND CRYPTOGRAPHY, 2001, 22 (03) :221-237

[2]

[Anonymous], PHILIPS RES REP S

[3] Perfect constant-weight codes [J].

Etzion, T ;

Schwartz, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (09) :2156-2165

[4]

FONDERFLAASS DG, P 985 AMS M IND U BL, P31

[5] Perfect single error-correcting codes in the Johnson scheme [J].

Gordon, Daniel M. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (10) :4670-4672

[6]

MARTIN WJ, 1988, J COMB DES, V6, P261

[7] On new completely regular q-ary codes [J].

Zinoviev, V. A. ;

Rifa, J. .

PROBLEMS OF INFORMATION TRANSMISSION, 2007, 43 (02) :97-112

← 1 →