Perfect colorings of the Johnson graphs J(8, 3) and J(8, 4) with two colors
- 58 Downloads
In this article the parameter matrices are enumerated of all perfect 2-colorings of the Johnson graphs J(8, 3) and J(8, 4), and several constructions are presented for perfect 2-coloring of J(2w, w) and J(2m, 3). The concept of a perfect coloring generalizes the concept of completely regular code introduced by P. Delsarte. The problem of existence of similar structures in Johnson graphs is closely related to the problem of existence of completely regular codes in Johnson graphs and, in particular, to the Delsarte conjecture on the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block designs, and other well-known problems.
Keywordsperfect coloring Johnson scheme block design
Unable to display preview. Download preview PDF.
- 3.D. Tsvetkovich, M. Dub, and Kh. Zakhs, Spectra of Graphs: Theory and Application (Naukova Dumka, Kiev, 1984) [in Russian].Google Scholar
- 4.D. G. Fon-der-Flaass, “Perfect 2-Colorings of a 12-Dimensional Cube That Achieve a Bound of Correlation Immunity,” Siberian Electron.Mat. Izv. No. 4, 292–295 (2007).Google Scholar
- 9.D. G. Fon-der-Flaass, “A Bound on Correlation Immunity,” Siberian Electron. Mat. Izv. No. 4, 133–135 (2007).Google Scholar
- 16.I. Yu. Mogilnykh and S. V. Avgustinovich, “Perfect Colorings with Two Colors of a Johnson Graph,” in Proceedings of the XI International Symposium on Problems of Redundancy in Information and Control Systems (St. Petersburg, Russia, July 2–6, 2007) (Saint Petersburg State Univ. of Aerospace Instrumentation, St. Petersburg, 2007), pp. 205–209.Google Scholar