|
Problemy Peredachi Informatsii, 2007, Volume 43, Issue 4, Pages 37–44
(Mi ppi25)
|
|
|
|
This article is cited in 11 scientific papers (total in 11 papers)
Coding Theory
On the Regularity of Perfect Two-Colorings of the Johnson Graph
I. Yu. Mogil'nykhab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Abstract:
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.
Received: 28.12.2006 Revised: 29.08.2007
Citation:
I. Yu. Mogil'nykh, “On the Regularity of Perfect Two-Colorings of the Johnson Graph”, Probl. Peredachi Inf., 43:4 (2007), 37–44; Problems Inform. Transmission, 43:4 (2007), 303–309
Linking options:
https://www.mathnet.ru/eng/ppi25 https://www.mathnet.ru/eng/ppi/v43/i4/p37
|
Statistics & downloads: |
Abstract page: | 640 | Full-text PDF : | 130 | References: | 50 | First page: | 20 |
|