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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Aydinian, H.K., Khachatrian, L.H.: On perfect codes and related concepts. Designs, Codes and Cryptography 22, 221–237 (2001)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance regular graphs. Springer, Berlin (1989)
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, 1–97 (1973)
Etzion, T., Schwarz, M.: Perfect constant-weight codes. IEEE Trans. Inform. Theory 50(9), 2156–2165 (2004)
Fon-Der-Flaass, D.G.: Perfect colorings of a hypercube. In: 985th AMS Meeting, Indiana University Bloomington, pp. 31–32 (2003)
Godsil, C.: Association schemes, combinatorics and optimization. University of Waterloo (2005)
Godsil, C., Gordon, R.: Algebraic graph theory. Springer Science+Business Media, LLC (2004)
Gordon, M.D.: Perfect single error-correcting codes in the Johnson scheme. IEEE Trans. Inform. Theory 52(10), 4670–4672 (2006)
Martin, W.J.: Completely regular designs. J. Combin. Designs. 6(4), 261–273 (1998)
Mogilnykh, I.Yu.: On the regularity of perfect 2-colorings of the Johnson graph. Probl. Inform. Transm. 43(4), 271–277 (2007)
Zinoviev, V.A., Rifa, J.: On new completely regular q-ary codes. Probl. Inform. Trans. 43(2), 97–112 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avgustinovich, S., Mogilnykh, I. (2008). Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3). In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-87448-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87447-8
Online ISBN: 978-3-540-87448-5
eBook Packages: Computer ScienceComputer Science (R0)