On perfect 2-colorings of Johnson graphs J(v, 3)

Authors

Alexander L. Gavrilyuk, N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
Sergey V. Goryainov, Chelyabinsk State University

Abstract

completely regular code; distance-regular graph; equitable partition; Johnson graph; perfect coloring

Publication Title

Journal of Combinatorial Designs

Recommended Citation

Gavrilyuk, A., & Goryainov, S. (2013). On perfect 2-colorings of Johnson graphs J(v, 3). Journal of Combinatorial Designs, 21 (6), 232-252. https://doi.org/10.1002/jcd.21327