Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)

Authors:
Sergey Avgustinovich;Ivan Mogilnykh
Affiliations:
Sobolev Institute of Mathematics and Novosibirsk State University, Russia 630090;Sobolev Institute of Mathematics and Novosibirsk State University, Russia 630090
Venue:
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Year:
2008

Citing 5
Cited 1

On Perfect Codes and Related Concepts

Designs, Codes and Cryptography
On new completely regular q-ary codes

Problems of Information Transmission
On the regularity of perfect 2-colorings of the Johnson graph

Problems of Information Transmission
Perfect constant-weight codes

IEEE Transactions on Information Theory
Perfect Single Error-Correcting Codes in the Johnson Scheme

IEEE Transactions on Information Theory

On weight distributions of perfect colorings and completely regular codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of the existence of perfect 2-colorings in Johnson graphs J(6,3) and J(7,3) is solved in this paper. Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte [3]. This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of completely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.