Abstract
A perfect 2-coloring of a graph \(\varGamma\) with matrix \(M=\{m_{ij}\}_{i, j=1, 2}\) is a coloring of the vertices \(\varGamma\) with colors called \(\{1, 2\}\) such that the number of vertices of color j adjacent to a fixed vertex of color i is equal to \(m_{ij}\). We state the matrix M is the parameter matrix. Each class of an equitable partition is the vertices with the same color. In this article, we classify the parameter matrices of whole perfect 2-colorings of the Johnson graph J(9, 4).
Similar content being viewed by others
References
Avgustinovich, S.V., Mogilnykh, IYu.: Perfect colorings of the Johnson graphs J(8,3) and J(8,4) with two colors. J. Appl. Indust. Math. 5, 19–30 (2011)
S. V. Avgustinovich and I. Yu. Mogilnykh; Perfect 2-Colorings of Johnson Graphs \(J(6,3)\) and \(J(7,3)\), in Lecture Notes in Computer Science, Vol. 5228, (Springer,2008) 11-19
Camion, P., Courteau, B., Delsarte, P.: On \(r\)-partition designs in Hamming spaces. Appl. Algebra Eng. Commun. Comput. 2, 147–162 (1992)
Gavrilyuk, A.L., Goryainov, S.V.: On perfect 2-colorings of Johnson graphs \(J(\upsilon, 3)\). J. Combin. Designs 21, 232–252 (2013)
Krotov, D.S.: On weight distributions of perfect colorings and completely regular codes. Des. Codes Cryptogr. 61, 315–329 (2011)
Meyerowitz, A.: Cycle-balanced partitions in distance-regular graphs. Discret. Math. 264, 149–165 (2003)
Mogilnykh, IYu.: On the regularity of perfect 2-colorings of the Johnson graph. Problemy Peredachi Inform. 43(4), 37–44 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Alaeiyan, M., Alaeiyan, E. Perfect 2-colorings of the Johnson graph J(9, 4). Math Sci 16, 133–136 (2022). https://doi.org/10.1007/s40096-021-00404-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40096-021-00404-6